/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/parallel-barrier-loop.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:03:32,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:03:32,729 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:03:32,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:03:32,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:03:32,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:03:32,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:03:32,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:03:32,754 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:03:32,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:03:32,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:03:32,757 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:03:32,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:03:32,759 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:03:32,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:03:32,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:03:32,760 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:03:32,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:03:32,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:03:32,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:03:32,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:03:32,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:03:32,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:03:32,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:03:32,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:03:32,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:03:32,763 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:03:32,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:03:32,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:03:32,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:03:32,972 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:03:32,972 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:03:32,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2023-11-30 03:03:34,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:03:34,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:03:34,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2023-11-30 03:03:34,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde47e806/eefd43ac63bf48559cdbd08047718024/FLAG9febc9a75 [2023-11-30 03:03:34,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde47e806/eefd43ac63bf48559cdbd08047718024 [2023-11-30 03:03:34,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:03:34,225 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:03:34,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:03:34,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:03:34,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:03:34,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ba27c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34, skipping insertion in model container [2023-11-30 03:03:34,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:03:34,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:03:34,440 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:03:34,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:03:34,483 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:03:34,484 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:03:34,488 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:03:34,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34 WrapperNode [2023-11-30 03:03:34,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:03:34,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:03:34,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:03:34,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:03:34,494 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:03:34" (1/1) ... [2023-11-30 03:03:34,501 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:03:34" (1/1) ... [2023-11-30 03:03:34,530 INFO L138 Inliner]: procedures = 25, calls = 121, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 515 [2023-11-30 03:03:34,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:03:34,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:03:34,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:03:34,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:03:34,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:03:34,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:03:34,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:03:34,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:03:34,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (1/1) ... [2023-11-30 03:03:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:03:34,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:03:34,605 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:03:34,639 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:03:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:03:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:03:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:03:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:03:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:03:34,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:03:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:03:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:03:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:03:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:03:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:03:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:03:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:03:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-30 03:03:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-30 03:03:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-30 03:03:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-30 03:03:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:03:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:03:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:03:34,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:03:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:03:34,652 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:03:34,767 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:03:34,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:03:35,243 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:03:35,351 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:03:35,351 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 03:03:35,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:35 BoogieIcfgContainer [2023-11-30 03:03:35,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:03:35,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:03:35,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:03:35,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:03:35,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:03:34" (1/3) ... [2023-11-30 03:03:35,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f9ee32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:03:35, skipping insertion in model container [2023-11-30 03:03:35,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:03:34" (2/3) ... [2023-11-30 03:03:35,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f9ee32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:03:35, skipping insertion in model container [2023-11-30 03:03:35,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:03:35" (3/3) ... [2023-11-30 03:03:35,359 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2023-11-30 03:03:35,371 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:03:35,371 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 82 error locations. [2023-11-30 03:03:35,371 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:03:35,478 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-11-30 03:03:35,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 490 transitions, 1046 flow [2023-11-30 03:03:35,644 INFO L124 PetriNetUnfolderBase]: 16/450 cut-off events. [2023-11-30 03:03:35,644 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 03:03:35,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 450 events. 16/450 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 878 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 368. Up to 3 conditions per place. [2023-11-30 03:03:35,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 490 transitions, 1046 flow [2023-11-30 03:03:35,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 431 places, 426 transitions, 900 flow [2023-11-30 03:03:35,677 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:03:35,682 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;@3a15528d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:03:35,682 INFO L363 AbstractCegarLoop]: Starting to check reachability of 148 error locations. [2023-11-30 03:03:35,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:03:35,686 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2023-11-30 03:03:35,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:03:35,686 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:35,687 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] [2023-11-30 03:03:35,687 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:03:35,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -692710090, now seen corresponding path program 1 times [2023-11-30 03:03:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:35,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517611956] [2023-11-30 03:03:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:35,882 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:03:35,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:35,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517611956] [2023-11-30 03:03:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517611956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:35,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957061135] [2023-11-30 03:03:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:35,889 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:35,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:35,914 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 494 [2023-11-30 03:03:35,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 426 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:03:35,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:35,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 494 [2023-11-30 03:03:35,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:44,908 INFO L124 PetriNetUnfolderBase]: 37106/60793 cut-off events. [2023-11-30 03:03:44,908 INFO L125 PetriNetUnfolderBase]: For 14766/14854 co-relation queries the response was YES. [2023-11-30 03:03:45,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121107 conditions, 60793 events. 37106/60793 cut-off events. For 14766/14854 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532378 event pairs, 26821 based on Foata normal form. 8201/61760 useless extension candidates. Maximal degree in co-relation 119904. Up to 47704 conditions per place. [2023-11-30 03:03:46,079 INFO L140 encePairwiseOnDemand]: 434/494 looper letters, 59 selfloop transitions, 2 changer transitions 1/368 dead transitions. [2023-11-30 03:03:46,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 368 transitions, 906 flow [2023-11-30 03:03:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1211 transitions. [2023-11-30 03:03:46,094 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8171390013495277 [2023-11-30 03:03:46,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1211 transitions. [2023-11-30 03:03:46,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1211 transitions. [2023-11-30 03:03:46,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:46,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1211 transitions. [2023-11-30 03:03:46,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 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:03:46,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:03:46,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:03:46,112 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -51 predicate places. [2023-11-30 03:03:46,112 INFO L500 AbstractCegarLoop]: Abstraction has has 380 places, 368 transitions, 906 flow [2023-11-30 03:03:46,113 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:03:46,113 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:46,113 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] [2023-11-30 03:03:46,113 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:03:46,113 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:03:46,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -573372191, now seen corresponding path program 1 times [2023-11-30 03:03:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360460613] [2023-11-30 03:03:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:46,180 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:03:46,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:46,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360460613] [2023-11-30 03:03:46,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360460613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:46,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:46,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:46,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195097710] [2023-11-30 03:03:46,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:46,182 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:46,184 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 494 [2023-11-30 03:03:46,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 368 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:03:46,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:46,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 494 [2023-11-30 03:03:46,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:54,544 INFO L124 PetriNetUnfolderBase]: 37106/60792 cut-off events. [2023-11-30 03:03:54,544 INFO L125 PetriNetUnfolderBase]: For 20679/31617 co-relation queries the response was YES. [2023-11-30 03:03:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168812 conditions, 60792 events. 37106/60792 cut-off events. For 20679/31617 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532956 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 167263. Up to 47704 conditions per place. [2023-11-30 03:03:55,497 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 59 selfloop transitions, 2 changer transitions 1/367 dead transitions. [2023-11-30 03:03:55,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 367 transitions, 1026 flow [2023-11-30 03:03:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2023-11-30 03:03:55,500 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7786774628879892 [2023-11-30 03:03:55,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1154 transitions. [2023-11-30 03:03:55,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1154 transitions. [2023-11-30 03:03:55,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:55,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1154 transitions. [2023-11-30 03:03:55,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 0 states have call successors, (0), 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:03:55,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:03:55,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:03:55,506 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -50 predicate places. [2023-11-30 03:03:55,506 INFO L500 AbstractCegarLoop]: Abstraction has has 381 places, 367 transitions, 1026 flow [2023-11-30 03:03:55,507 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:03:55,507 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:55,507 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] [2023-11-30 03:03:55,507 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:03:55,507 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:03:55,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash 963132774, now seen corresponding path program 1 times [2023-11-30 03:03:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:55,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301903453] [2023-11-30 03:03:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:55,534 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:03:55,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:55,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301903453] [2023-11-30 03:03:55,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301903453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:55,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:55,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80767233] [2023-11-30 03:03:55,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:55,536 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:55,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:55,537 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 494 [2023-11-30 03:03:55,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 367 transitions, 1026 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:03:55,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:55,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 494 [2023-11-30 03:03:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:04,620 INFO L124 PetriNetUnfolderBase]: 37106/60791 cut-off events. [2023-11-30 03:04:04,620 INFO L125 PetriNetUnfolderBase]: For 30171/51959 co-relation queries the response was YES. [2023-11-30 03:04:05,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216517 conditions, 60791 events. 37106/60791 cut-off events. For 30171/51959 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 533334 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 214622. Up to 47704 conditions per place. [2023-11-30 03:04:05,823 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 59 selfloop transitions, 2 changer transitions 1/366 dead transitions. [2023-11-30 03:04:05,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 366 transitions, 1146 flow [2023-11-30 03:04:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2023-11-30 03:04:05,842 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7786774628879892 [2023-11-30 03:04:05,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1154 transitions. [2023-11-30 03:04:05,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1154 transitions. [2023-11-30 03:04:05,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:05,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1154 transitions. [2023-11-30 03:04:05,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 0 states have call successors, (0), 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:04:05,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:05,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:05,849 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -49 predicate places. [2023-11-30 03:04:05,849 INFO L500 AbstractCegarLoop]: Abstraction has has 382 places, 366 transitions, 1146 flow [2023-11-30 03:04:05,849 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:04:05,849 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:05,849 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] [2023-11-30 03:04:05,850 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:04:05,850 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:04:05,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1925587738, now seen corresponding path program 1 times [2023-11-30 03:04:05,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066214635] [2023-11-30 03:04:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:05,889 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:04:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:05,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066214635] [2023-11-30 03:04:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066214635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437611910] [2023-11-30 03:04:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:05,890 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:05,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:05,892 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 494 [2023-11-30 03:04:05,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 366 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:04:05,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:05,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 494 [2023-11-30 03:04:05,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:14,797 INFO L124 PetriNetUnfolderBase]: 37106/60790 cut-off events. [2023-11-30 03:04:14,798 INFO L125 PetriNetUnfolderBase]: For 43242/75880 co-relation queries the response was YES. [2023-11-30 03:04:15,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264221 conditions, 60790 events. 37106/60790 cut-off events. For 43242/75880 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532548 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 261981. Up to 47704 conditions per place. [2023-11-30 03:04:16,335 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 58 selfloop transitions, 2 changer transitions 1/365 dead transitions. [2023-11-30 03:04:16,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 365 transitions, 1264 flow [2023-11-30 03:04:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions. [2023-11-30 03:04:16,338 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7780026990553306 [2023-11-30 03:04:16,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1153 transitions. [2023-11-30 03:04:16,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1153 transitions. [2023-11-30 03:04:16,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:16,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1153 transitions. [2023-11-30 03:04:16,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 0 states have call successors, (0), 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:04:16,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:16,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:16,344 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -48 predicate places. [2023-11-30 03:04:16,344 INFO L500 AbstractCegarLoop]: Abstraction has has 383 places, 365 transitions, 1264 flow [2023-11-30 03:04:16,344 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 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:04:16,345 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:16,345 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] [2023-11-30 03:04:16,345 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:04:16,345 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:04:16,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash -561017716, now seen corresponding path program 1 times [2023-11-30 03:04:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892155723] [2023-11-30 03:04:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:16,367 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:04:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892155723] [2023-11-30 03:04:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892155723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391105570] [2023-11-30 03:04:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:16,368 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:16,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:16,369 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:04:16,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 365 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:16,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:16,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:04:16,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:26,009 INFO L124 PetriNetUnfolderBase]: 37106/60789 cut-off events. [2023-11-30 03:04:26,009 INFO L125 PetriNetUnfolderBase]: For 59892/103380 co-relation queries the response was YES. [2023-11-30 03:04:26,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311920 conditions, 60789 events. 37106/60789 cut-off events. For 59892/103380 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532904 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 309340. Up to 47704 conditions per place. [2023-11-30 03:04:27,633 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/364 dead transitions. [2023-11-30 03:04:27,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 364 transitions, 1372 flow [2023-11-30 03:04:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:04:27,646 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:04:27,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:04:27,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:04:27,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:27,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:04:27,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:04:27,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:27,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:27,651 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -47 predicate places. [2023-11-30 03:04:27,651 INFO L500 AbstractCegarLoop]: Abstraction has has 384 places, 364 transitions, 1372 flow [2023-11-30 03:04:27,652 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:27,652 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:27,652 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] [2023-11-30 03:04:27,652 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:04:27,652 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:04:27,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1155469772, now seen corresponding path program 1 times [2023-11-30 03:04:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347094392] [2023-11-30 03:04:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:27,700 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:04:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347094392] [2023-11-30 03:04:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347094392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738513802] [2023-11-30 03:04:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:27,701 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:27,702 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:04:27,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 364 transitions, 1372 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:27,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:27,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:04:27,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:38,627 INFO L124 PetriNetUnfolderBase]: 37106/60788 cut-off events. [2023-11-30 03:04:38,627 INFO L125 PetriNetUnfolderBase]: For 80121/134459 co-relation queries the response was YES. [2023-11-30 03:04:39,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359619 conditions, 60788 events. 37106/60788 cut-off events. For 80121/134459 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532789 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 356699. Up to 47704 conditions per place. [2023-11-30 03:04:40,490 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2023-11-30 03:04:40,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 363 transitions, 1480 flow [2023-11-30 03:04:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:04:40,520 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:04:40,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:04:40,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:04:40,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:40,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:04:40,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:04:40,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:40,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:40,528 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -46 predicate places. [2023-11-30 03:04:40,528 INFO L500 AbstractCegarLoop]: Abstraction has has 385 places, 363 transitions, 1480 flow [2023-11-30 03:04:40,529 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:40,529 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:40,529 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] [2023-11-30 03:04:40,529 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:04:40,529 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:04:40,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1206331162, now seen corresponding path program 1 times [2023-11-30 03:04:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749301967] [2023-11-30 03:04:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:40,587 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:04:40,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:40,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749301967] [2023-11-30 03:04:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749301967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:40,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:40,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11638136] [2023-11-30 03:04:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:40,590 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:40,591 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:04:40,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 363 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:40,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:40,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:04:40,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:50,283 INFO L124 PetriNetUnfolderBase]: 37106/60787 cut-off events. [2023-11-30 03:04:50,283 INFO L125 PetriNetUnfolderBase]: For 103929/169117 co-relation queries the response was YES. [2023-11-30 03:04:50,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407318 conditions, 60787 events. 37106/60787 cut-off events. For 103929/169117 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532142 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 404058. Up to 47704 conditions per place. [2023-11-30 03:04:52,150 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/362 dead transitions. [2023-11-30 03:04:52,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 362 transitions, 1588 flow [2023-11-30 03:04:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:04:52,172 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:04:52,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:04:52,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:04:52,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:52,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:04:52,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:04:52,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:52,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:04:52,177 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -45 predicate places. [2023-11-30 03:04:52,177 INFO L500 AbstractCegarLoop]: Abstraction has has 386 places, 362 transitions, 1588 flow [2023-11-30 03:04:52,178 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:52,187 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:52,187 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] [2023-11-30 03:04:52,188 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:04:52,188 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:04:52,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -243943197, now seen corresponding path program 1 times [2023-11-30 03:04:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:52,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808913980] [2023-11-30 03:04:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:52,232 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:04:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808913980] [2023-11-30 03:04:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808913980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:52,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:52,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748421690] [2023-11-30 03:04:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:52,233 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:52,235 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:04:52,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 362 transitions, 1588 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:04:52,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:52,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:04:52,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:05:02,600 INFO L124 PetriNetUnfolderBase]: 37106/60786 cut-off events. [2023-11-30 03:05:02,601 INFO L125 PetriNetUnfolderBase]: For 131316/207354 co-relation queries the response was YES. [2023-11-30 03:05:03,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455017 conditions, 60786 events. 37106/60786 cut-off events. For 131316/207354 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532201 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 451420. Up to 47704 conditions per place. [2023-11-30 03:05:04,718 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/361 dead transitions. [2023-11-30 03:05:04,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 361 transitions, 1696 flow [2023-11-30 03:05:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:05:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:05:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:05:04,730 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:05:04,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:05:04,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:05:04,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:05:04,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:05:04,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:05:04,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:04,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:04,746 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -44 predicate places. [2023-11-30 03:05:04,747 INFO L500 AbstractCegarLoop]: Abstraction has has 387 places, 361 transitions, 1696 flow [2023-11-30 03:05:04,747 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:04,747 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:05:04,747 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] [2023-11-30 03:05:04,747 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:05:04,747 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:05:04,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:05:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1993116615, now seen corresponding path program 1 times [2023-11-30 03:05:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:05:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844685367] [2023-11-30 03:05:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:05:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:05:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:05:04,819 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:05:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:05:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844685367] [2023-11-30 03:05:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844685367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:05:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:05:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:05:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541748505] [2023-11-30 03:05:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:05:04,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:05:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:05:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:05:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:05:04,821 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:05:04,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 361 transitions, 1696 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:04,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:05:04,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:05:04,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:05:18,315 INFO L124 PetriNetUnfolderBase]: 37106/60785 cut-off events. [2023-11-30 03:05:18,316 INFO L125 PetriNetUnfolderBase]: For 162282/249170 co-relation queries the response was YES. [2023-11-30 03:05:19,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502716 conditions, 60785 events. 37106/60785 cut-off events. For 162282/249170 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532710 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 498787. Up to 47704 conditions per place. [2023-11-30 03:05:20,362 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/360 dead transitions. [2023-11-30 03:05:20,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 360 transitions, 1804 flow [2023-11-30 03:05:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:05:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:05:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:05:20,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:05:20,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:05:20,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:05:20,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:05:20,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:05:20,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:05:20,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:20,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:20,368 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -43 predicate places. [2023-11-30 03:05:20,368 INFO L500 AbstractCegarLoop]: Abstraction has has 388 places, 360 transitions, 1804 flow [2023-11-30 03:05:20,369 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:20,369 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:05:20,369 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] [2023-11-30 03:05:20,369 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:05:20,369 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:05:20,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:05:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1909175389, now seen corresponding path program 1 times [2023-11-30 03:05:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:05:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845285066] [2023-11-30 03:05:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:05:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:05:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:05:20,386 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:05:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:05:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845285066] [2023-11-30 03:05:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845285066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:05:20,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:05:20,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:05:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201008702] [2023-11-30 03:05:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:05:20,387 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:05:20,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:05:20,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:05:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:05:20,388 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:05:20,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 360 transitions, 1804 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:20,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:05:20,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:05:20,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:05:31,679 INFO L124 PetriNetUnfolderBase]: 37106/60784 cut-off events. [2023-11-30 03:05:31,679 INFO L125 PetriNetUnfolderBase]: For 196827/294565 co-relation queries the response was YES. [2023-11-30 03:05:32,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550415 conditions, 60784 events. 37106/60784 cut-off events. For 196827/294565 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 533655 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 546154. Up to 47704 conditions per place. [2023-11-30 03:05:33,836 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/359 dead transitions. [2023-11-30 03:05:33,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 359 transitions, 1912 flow [2023-11-30 03:05:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:05:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:05:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:05:33,838 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:05:33,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:05:33,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:05:33,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:05:33,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:05:33,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:05:33,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:33,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:33,843 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -42 predicate places. [2023-11-30 03:05:33,843 INFO L500 AbstractCegarLoop]: Abstraction has has 389 places, 359 transitions, 1912 flow [2023-11-30 03:05:33,843 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:33,843 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:05:33,843 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] [2023-11-30 03:05:33,843 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:05:33,843 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:05:33,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:05:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash 243802834, now seen corresponding path program 1 times [2023-11-30 03:05:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:05:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025414135] [2023-11-30 03:05:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:05:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:05:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:05:33,878 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:05:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:05:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025414135] [2023-11-30 03:05:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025414135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:05:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:05:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:05:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359258980] [2023-11-30 03:05:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:05:33,879 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:05:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:05:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:05:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:05:33,880 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:05:33,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 359 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:33,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:05:33,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:05:33,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:05:45,953 INFO L124 PetriNetUnfolderBase]: 37106/60783 cut-off events. [2023-11-30 03:05:45,954 INFO L125 PetriNetUnfolderBase]: For 234951/343539 co-relation queries the response was YES. [2023-11-30 03:05:46,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598114 conditions, 60783 events. 37106/60783 cut-off events. For 234951/343539 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 533064 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 593521. Up to 47704 conditions per place. [2023-11-30 03:05:48,619 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/358 dead transitions. [2023-11-30 03:05:48,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 358 transitions, 2020 flow [2023-11-30 03:05:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:05:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:05:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:05:48,621 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:05:48,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:05:48,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:05:48,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:05:48,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:05:48,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:05:48,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:48,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:05:48,731 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -41 predicate places. [2023-11-30 03:05:48,731 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 358 transitions, 2020 flow [2023-11-30 03:05:48,732 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:48,732 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:05:48,732 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] [2023-11-30 03:05:48,732 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:05:48,732 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:05:48,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:05:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1036756642, now seen corresponding path program 1 times [2023-11-30 03:05:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:05:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599419450] [2023-11-30 03:05:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:05:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:05:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:05:48,784 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:05:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:05:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599419450] [2023-11-30 03:05:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599419450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:05:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:05:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:05:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247944614] [2023-11-30 03:05:48,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:05:48,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:05:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:05:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:05:48,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:05:48,786 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:05:48,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 358 transitions, 2020 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:05:48,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:05:48,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:05:48,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:06:03,541 INFO L124 PetriNetUnfolderBase]: 37106/60782 cut-off events. [2023-11-30 03:06:03,541 INFO L125 PetriNetUnfolderBase]: For 276654/396092 co-relation queries the response was YES. [2023-11-30 03:06:04,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645813 conditions, 60782 events. 37106/60782 cut-off events. For 276654/396092 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532762 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 640888. Up to 47704 conditions per place. [2023-11-30 03:06:06,193 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/357 dead transitions. [2023-11-30 03:06:06,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 357 transitions, 2128 flow [2023-11-30 03:06:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:06:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:06:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:06:06,195 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:06:06,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:06:06,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:06:06,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:06:06,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:06:06,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:06:06,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:06:06,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:06:06,199 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -40 predicate places. [2023-11-30 03:06:06,199 INFO L500 AbstractCegarLoop]: Abstraction has has 391 places, 357 transitions, 2128 flow [2023-11-30 03:06:06,200 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:06:06,200 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:06:06,200 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] [2023-11-30 03:06:06,200 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:06:06,200 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:06:06,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:06:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1137103558, now seen corresponding path program 1 times [2023-11-30 03:06:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:06:06,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296221951] [2023-11-30 03:06:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:06:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:06:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:06:06,224 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:06:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:06:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296221951] [2023-11-30 03:06:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296221951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:06:06,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:06:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:06:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407257206] [2023-11-30 03:06:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:06:06,225 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:06:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:06:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:06:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:06:06,226 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:06:06,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 357 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:06:06,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:06:06,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:06:06,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:06:22,388 INFO L124 PetriNetUnfolderBase]: 37106/60781 cut-off events. [2023-11-30 03:06:22,389 INFO L125 PetriNetUnfolderBase]: For 321936/452224 co-relation queries the response was YES. [2023-11-30 03:06:23,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693512 conditions, 60781 events. 37106/60781 cut-off events. For 321936/452224 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 533422 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 688255. Up to 47704 conditions per place. [2023-11-30 03:06:24,989 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/356 dead transitions. [2023-11-30 03:06:24,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 356 transitions, 2236 flow [2023-11-30 03:06:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:06:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:06:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:06:24,991 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:06:24,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:06:24,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:06:24,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:06:24,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:06:24,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:06:24,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:06:24,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:06:24,995 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -39 predicate places. [2023-11-30 03:06:24,995 INFO L500 AbstractCegarLoop]: Abstraction has has 392 places, 356 transitions, 2236 flow [2023-11-30 03:06:24,995 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:06:24,995 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:06:24,996 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] [2023-11-30 03:06:24,996 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:06:24,996 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:06:24,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:06:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -319972522, now seen corresponding path program 1 times [2023-11-30 03:06:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:06:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816270681] [2023-11-30 03:06:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:06:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:06:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:06:25,013 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:06:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:06:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816270681] [2023-11-30 03:06:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816270681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:06:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:06:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:06:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625745750] [2023-11-30 03:06:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:06:25,014 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:06:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:06:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:06:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:06:25,015 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:06:25,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 356 transitions, 2236 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:06:25,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:06:25,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:06:25,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:06:38,245 INFO L124 PetriNetUnfolderBase]: 37106/60780 cut-off events. [2023-11-30 03:06:38,246 INFO L125 PetriNetUnfolderBase]: For 370797/511935 co-relation queries the response was YES. [2023-11-30 03:06:38,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741211 conditions, 60780 events. 37106/60780 cut-off events. For 370797/511935 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 532830 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 735622. Up to 47704 conditions per place. [2023-11-30 03:06:40,968 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/355 dead transitions. [2023-11-30 03:06:40,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 355 transitions, 2344 flow [2023-11-30 03:06:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:06:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:06:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:06:40,970 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:06:40,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:06:40,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:06:40,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:06:40,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:06:40,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:06:40,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:06:40,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:06:40,973 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -38 predicate places. [2023-11-30 03:06:40,974 INFO L500 AbstractCegarLoop]: Abstraction has has 393 places, 355 transitions, 2344 flow [2023-11-30 03:06:40,974 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:06:40,974 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:06:40,974 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] [2023-11-30 03:06:40,974 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:06:40,974 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:06:40,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:06:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash -457368411, now seen corresponding path program 1 times [2023-11-30 03:06:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:06:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725041513] [2023-11-30 03:06:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:06:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:06:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:06:40,993 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:06:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:06:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725041513] [2023-11-30 03:06:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725041513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:06:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:06:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:06:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2663655] [2023-11-30 03:06:40,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:06:40,994 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:06:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:06:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:06:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:06:40,995 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:06:40,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 355 transitions, 2344 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:06:40,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:06:40,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:06:40,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:06:58,042 INFO L124 PetriNetUnfolderBase]: 37106/60779 cut-off events. [2023-11-30 03:06:58,042 INFO L125 PetriNetUnfolderBase]: For 423237/575225 co-relation queries the response was YES. [2023-11-30 03:06:58,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788910 conditions, 60779 events. 37106/60779 cut-off events. For 423237/575225 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 533312 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 782989. Up to 47704 conditions per place. [2023-11-30 03:07:00,987 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/354 dead transitions. [2023-11-30 03:07:00,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 354 transitions, 2452 flow [2023-11-30 03:07:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:07:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:07:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:07:00,989 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:07:00,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:07:00,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:07:00,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:07:00,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:07:00,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:07:00,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:07:00,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:07:00,993 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -37 predicate places. [2023-11-30 03:07:00,993 INFO L500 AbstractCegarLoop]: Abstraction has has 394 places, 354 transitions, 2452 flow [2023-11-30 03:07:00,993 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:07:00,993 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:07:00,993 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] [2023-11-30 03:07:00,993 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:07:00,993 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:07:00,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:07:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 902577622, now seen corresponding path program 1 times [2023-11-30 03:07:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:07:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422765695] [2023-11-30 03:07:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:07:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:07:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:07:01,013 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:07:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:07:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422765695] [2023-11-30 03:07:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422765695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:07:01,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:07:01,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:07:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641595979] [2023-11-30 03:07:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:07:01,014 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:07:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:07:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:07:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:07:01,015 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 494 [2023-11-30 03:07:01,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 354 transitions, 2452 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:07:01,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:07:01,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 494 [2023-11-30 03:07:01,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:07:16,646 INFO L124 PetriNetUnfolderBase]: 37106/60778 cut-off events. [2023-11-30 03:07:16,646 INFO L125 PetriNetUnfolderBase]: For 479256/642094 co-relation queries the response was YES. [2023-11-30 03:07:17,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836609 conditions, 60778 events. 37106/60778 cut-off events. For 479256/642094 co-relation queries the response was YES. Maximal size of possible extension queue 2779. Compared 533012 event pairs, 26821 based on Foata normal form. 0/53559 useless extension candidates. Maximal degree in co-relation 830356. Up to 47704 conditions per place. [2023-11-30 03:07:19,589 INFO L140 encePairwiseOnDemand]: 491/494 looper letters, 53 selfloop transitions, 2 changer transitions 1/353 dead transitions. [2023-11-30 03:07:19,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 353 transitions, 2560 flow [2023-11-30 03:07:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:07:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:07:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2023-11-30 03:07:19,591 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.786774628879892 [2023-11-30 03:07:19,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1166 transitions. [2023-11-30 03:07:19,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1166 transitions. [2023-11-30 03:07:19,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:07:19,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1166 transitions. [2023-11-30 03:07:19,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.6666666666667) internal successors, (1166), 3 states have internal predecessors, (1166), 0 states have call successors, (0), 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:07:19,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:07:19,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:07:19,614 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -36 predicate places. [2023-11-30 03:07:19,614 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 353 transitions, 2560 flow [2023-11-30 03:07:19,614 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 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:07:19,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:07:19,615 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] [2023-11-30 03:07:19,615 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:07:19,615 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:07:19,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:07:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -646869087, now seen corresponding path program 1 times [2023-11-30 03:07:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:07:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562690524] [2023-11-30 03:07:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:07:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:07:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:07:19,678 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:07:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:07:19,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562690524] [2023-11-30 03:07:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562690524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:07:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:07:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:07:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581504569] [2023-11-30 03:07:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:07:19,681 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:07:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:07:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:07:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:07:19,682 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2023-11-30 03:07:19,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 353 transitions, 2560 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:07:19,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:07:19,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2023-11-30 03:07:19,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:07:44,441 INFO L124 PetriNetUnfolderBase]: 46197/82041 cut-off events. [2023-11-30 03:07:44,441 INFO L125 PetriNetUnfolderBase]: For 764895/1011255 co-relation queries the response was YES. [2023-11-30 03:07:45,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108948 conditions, 82041 events. 46197/82041 cut-off events. For 764895/1011255 co-relation queries the response was YES. Maximal size of possible extension queue 3335. Compared 816306 event pairs, 9067 based on Foata normal form. 9/72369 useless extension candidates. Maximal degree in co-relation 1100609. Up to 59490 conditions per place. [2023-11-30 03:07:49,000 INFO L140 encePairwiseOnDemand]: 486/494 looper letters, 98 selfloop transitions, 6 changer transitions 1/399 dead transitions. [2023-11-30 03:07:49,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 399 transitions, 4404 flow [2023-11-30 03:07:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:07:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:07:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1210 transitions. [2023-11-30 03:07:49,002 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8164642375168691 [2023-11-30 03:07:49,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1210 transitions. [2023-11-30 03:07:49,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1210 transitions. [2023-11-30 03:07:49,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:07:49,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1210 transitions. [2023-11-30 03:07:49,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 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:07:49,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:07:49,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:07:49,021 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -36 predicate places. [2023-11-30 03:07:49,021 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 399 transitions, 4404 flow [2023-11-30 03:07:49,021 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:07:49,021 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:07:49,022 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] [2023-11-30 03:07:49,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:07:49,022 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:07:49,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:07:49,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1129110925, now seen corresponding path program 1 times [2023-11-30 03:07:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:07:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736587418] [2023-11-30 03:07:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:07:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:07:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:07:49,086 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:07:49,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:07:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736587418] [2023-11-30 03:07:49,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736587418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:07:49,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:07:49,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:07:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023261898] [2023-11-30 03:07:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:07:49,087 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:07:49,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:07:49,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:07:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:07:49,089 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2023-11-30 03:07:49,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 399 transitions, 4404 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:07:49,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:07:49,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2023-11-30 03:07:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:08:22,382 INFO L124 PetriNetUnfolderBase]: 57121/102972 cut-off events. [2023-11-30 03:08:22,383 INFO L125 PetriNetUnfolderBase]: For 1104642/1372786 co-relation queries the response was YES. [2023-11-30 03:08:23,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447494 conditions, 102972 events. 57121/102972 cut-off events. For 1104642/1372786 co-relation queries the response was YES. Maximal size of possible extension queue 4064. Compared 1062968 event pairs, 3060 based on Foata normal form. 27/90890 useless extension candidates. Maximal degree in co-relation 1438683. Up to 73643 conditions per place. [2023-11-30 03:08:27,445 INFO L140 encePairwiseOnDemand]: 486/494 looper letters, 184 selfloop transitions, 10 changer transitions 1/488 dead transitions. [2023-11-30 03:08:27,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 488 transitions, 8103 flow [2023-11-30 03:08:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:08:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:08:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1209 transitions. [2023-11-30 03:08:27,448 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8157894736842105 [2023-11-30 03:08:27,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1209 transitions. [2023-11-30 03:08:27,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1209 transitions. [2023-11-30 03:08:27,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:08:27,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1209 transitions. [2023-11-30 03:08:27,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 403.0) internal successors, (1209), 3 states have internal predecessors, (1209), 0 states have call successors, (0), 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:08:27,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:08:27,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:08:27,452 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -36 predicate places. [2023-11-30 03:08:27,452 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 488 transitions, 8103 flow [2023-11-30 03:08:27,452 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:08:27,452 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:08:27,452 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] [2023-11-30 03:08:27,452 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:08:27,452 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:08:27,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:08:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash -235305731, now seen corresponding path program 1 times [2023-11-30 03:08:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:08:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955268229] [2023-11-30 03:08:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:08:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:08:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:08:27,482 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:08:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:08:27,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955268229] [2023-11-30 03:08:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955268229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:08:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:08:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:08:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767912928] [2023-11-30 03:08:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:08:27,483 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:08:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:08:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:08:27,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:08:27,484 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2023-11-30 03:08:27,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 488 transitions, 8103 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:08:27,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:08:27,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2023-11-30 03:08:27,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:09:09,297 INFO L124 PetriNetUnfolderBase]: 69414/125760 cut-off events. [2023-11-30 03:09:09,297 INFO L125 PetriNetUnfolderBase]: For 1474285/1830702 co-relation queries the response was YES. [2023-11-30 03:09:10,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855114 conditions, 125760 events. 69414/125760 cut-off events. For 1474285/1830702 co-relation queries the response was YES. Maximal size of possible extension queue 4785. Compared 1332139 event pairs, 3256 based on Foata normal form. 117/111471 useless extension candidates. Maximal degree in co-relation 1680345. Up to 89780 conditions per place. [2023-11-30 03:09:16,030 INFO L140 encePairwiseOnDemand]: 486/494 looper letters, 335 selfloop transitions, 18 changer transitions 1/646 dead transitions. [2023-11-30 03:09:16,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 646 transitions, 14988 flow [2023-11-30 03:09:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:09:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:09:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2023-11-30 03:09:16,033 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8184885290148448 [2023-11-30 03:09:16,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1213 transitions. [2023-11-30 03:09:16,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1213 transitions. [2023-11-30 03:09:16,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:09:16,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1213 transitions. [2023-11-30 03:09:16,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 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:09:16,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:09:16,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 494.0) internal successors, (1976), 4 states have internal predecessors, (1976), 0 states have call successors, (0), 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:09:16,037 INFO L307 CegarLoopForPetriNet]: 431 programPoint places, -36 predicate places. [2023-11-30 03:09:16,037 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 646 transitions, 14988 flow [2023-11-30 03:09:16,037 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:09:16,037 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:09:16,038 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:09:16,038 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:09:16,038 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 144 more)] === [2023-11-30 03:09:16,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:09:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1504498412, now seen corresponding path program 1 times [2023-11-30 03:09:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:09:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720083735] [2023-11-30 03:09:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:09:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:09:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:09:16,108 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:09:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:09:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720083735] [2023-11-30 03:09:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720083735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:09:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:09:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:09:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163513019] [2023-11-30 03:09:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:09:16,109 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:09:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:09:16,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:09:16,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:09:16,111 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 494 [2023-11-30 03:09:16,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 646 transitions, 14988 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 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:09:16,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:09:16,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 494 [2023-11-30 03:09:16,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand