/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/pthread-ext/14_spin2003-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 00:23:23,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 00:23:24,003 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 00:23:24,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 00:23:24,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 00:23:24,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 00:23:24,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 00:23:24,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 00:23:24,019 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 00:23:24,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 00:23:24,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 00:23:24,020 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 00:23:24,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 00:23:24,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 00:23:24,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 00:23:24,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 00:23:24,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 00:23:24,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 00:23:24,021 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 00:23:24,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 00:23:24,022 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 00:23:24,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 00:23:24,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 00:23:24,023 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 00:23:24,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 00:23:24,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:23:24,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 00:23:24,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 00:23:24,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 00:23:24,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 00:23:24,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 00:23:24,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 00:23:24,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 00:23:24,028 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 00:23:24,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 00:23:24,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 00:23:24,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 00:23:24,217 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 00:23:24,218 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 00:23:24,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i [2023-11-30 00:23:25,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 00:23:25,467 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 00:23:25,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i [2023-11-30 00:23:25,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002b9b6e0/83b33d25f51b4b9cab261dd17badbe07/FLAG1322b79d3 [2023-11-30 00:23:25,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/002b9b6e0/83b33d25f51b4b9cab261dd17badbe07 [2023-11-30 00:23:25,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 00:23:25,500 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 00:23:25,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 00:23:25,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 00:23:25,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 00:23:25,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4863a995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25, skipping insertion in model container [2023-11-30 00:23:25,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,542 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 00:23:25,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:23:25,776 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 00:23:25,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:23:25,829 INFO L206 MainTranslator]: Completed translation [2023-11-30 00:23:25,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25 WrapperNode [2023-11-30 00:23:25,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 00:23:25,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 00:23:25,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 00:23:25,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 00:23:25,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,856 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2023-11-30 00:23:25,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 00:23:25,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 00:23:25,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 00:23:25,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 00:23:25,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 00:23:25,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 00:23:25,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 00:23:25,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 00:23:25,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (1/1) ... [2023-11-30 00:23:25,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:23:25,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 00:23:25,900 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 00:23:25,905 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 00:23:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 00:23:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 00:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 00:23:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 00:23:25,920 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 00:23:26,055 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 00:23:26,056 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 00:23:26,151 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 00:23:26,161 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 00:23:26,161 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-30 00:23:26,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:23:26 BoogieIcfgContainer [2023-11-30 00:23:26,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 00:23:26,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 00:23:26,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 00:23:26,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 00:23:26,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:23:25" (1/3) ... [2023-11-30 00:23:26,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b57c7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:23:26, skipping insertion in model container [2023-11-30 00:23:26,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:23:25" (2/3) ... [2023-11-30 00:23:26,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b57c7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:23:26, skipping insertion in model container [2023-11-30 00:23:26,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:23:26" (3/3) ... [2023-11-30 00:23:26,167 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003-pthread.i [2023-11-30 00:23:26,178 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 00:23:26,178 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-30 00:23:26,178 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 00:23:26,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:26,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 63 transitions, 130 flow [2023-11-30 00:23:26,255 INFO L124 PetriNetUnfolderBase]: 4/74 cut-off events. [2023-11-30 00:23:26,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:26,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 4/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2023-11-30 00:23:26,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 63 transitions, 130 flow [2023-11-30 00:23:26,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 63 transitions, 130 flow [2023-11-30 00:23:26,269 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:26,272 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;@10fe3e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:26,273 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-30 00:23:26,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:26,281 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:23:26,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:23:26,281 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:26,282 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] [2023-11-30 00:23:26,282 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-30 00:23:26,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash -546884405, now seen corresponding path program 1 times [2023-11-30 00:23:26,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:26,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523737227] [2023-11-30 00:23:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:26,475 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 00:23:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:26,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523737227] [2023-11-30 00:23:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523737227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:26,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:26,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623279724] [2023-11-30 00:23:26,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:26,486 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:26,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:26,505 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 63 [2023-11-30 00:23:26,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 00:23:26,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:26,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 63 [2023-11-30 00:23:26,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:26,543 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2023-11-30 00:23:26,543 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:23:26,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 54 events. 0/54 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 15/66 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2023-11-30 00:23:26,544 INFO L140 encePairwiseOnDemand]: 56/63 looper letters, 11 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-30 00:23:26,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 130 flow [2023-11-30 00:23:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-30 00:23:26,552 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8042328042328042 [2023-11-30 00:23:26,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-30 00:23:26,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-30 00:23:26,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:26,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-30 00:23:26,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 00:23:26,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 00:23:26,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 00:23:26,562 INFO L307 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2023-11-30 00:23:26,563 INFO L500 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 130 flow [2023-11-30 00:23:26,563 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 00:23:26,563 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:26,563 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:26,563 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 00:23:26,563 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-30 00:23:26,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2017439352, now seen corresponding path program 1 times [2023-11-30 00:23:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171544555] [2023-11-30 00:23:26,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:26,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:23:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:26,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:23:26,615 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:23:26,617 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-30 00:23:26,619 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-30 00:23:26,619 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-30 00:23:26,619 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-30 00:23:26,620 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-30 00:23:26,620 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-30 00:23:26,620 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-30 00:23:26,620 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 00:23:26,620 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-30 00:23:26,622 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:23:26,622 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 00:23:26,642 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:26,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 200 flow [2023-11-30 00:23:26,659 INFO L124 PetriNetUnfolderBase]: 7/119 cut-off events. [2023-11-30 00:23:26,659 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 00:23:26,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 119 events. 7/119 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 212 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 6 conditions per place. [2023-11-30 00:23:26,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 95 transitions, 200 flow [2023-11-30 00:23:26,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 95 transitions, 200 flow [2023-11-30 00:23:26,662 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:26,663 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;@10fe3e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:26,663 INFO L363 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-30 00:23:26,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:26,668 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:23:26,668 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:23:26,669 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:26,669 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] [2023-11-30 00:23:26,669 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-30 00:23:26,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1806090646, now seen corresponding path program 1 times [2023-11-30 00:23:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483704773] [2023-11-30 00:23:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:26,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:26,714 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 00:23:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483704773] [2023-11-30 00:23:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483704773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:26,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707806549] [2023-11-30 00:23:26,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:26,715 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:26,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:26,716 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 95 [2023-11-30 00:23:26,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 00:23:26,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:26,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 95 [2023-11-30 00:23:26,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:26,854 INFO L124 PetriNetUnfolderBase]: 171/619 cut-off events. [2023-11-30 00:23:26,854 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-30 00:23:26,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 619 events. 171/619 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3565 event pairs, 127 based on Foata normal form. 250/752 useless extension candidates. Maximal degree in co-relation 897. Up to 317 conditions per place. [2023-11-30 00:23:26,859 INFO L140 encePairwiseOnDemand]: 82/95 looper letters, 34 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2023-11-30 00:23:26,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 279 flow [2023-11-30 00:23:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2023-11-30 00:23:26,864 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8210526315789474 [2023-11-30 00:23:26,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2023-11-30 00:23:26,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2023-11-30 00:23:26,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:26,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2023-11-30 00:23:26,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 00:23:26,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 00:23:26,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 00:23:26,874 INFO L307 CegarLoopForPetriNet]: 95 programPoint places, -10 predicate places. [2023-11-30 00:23:26,874 INFO L500 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 279 flow [2023-11-30 00:23:26,874 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 00:23:26,874 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:26,874 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] [2023-11-30 00:23:26,874 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 00:23:26,874 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-30 00:23:26,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash -828825003, now seen corresponding path program 1 times [2023-11-30 00:23:26,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:26,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916083909] [2023-11-30 00:23:26,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:26,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:26,952 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 00:23:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:26,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916083909] [2023-11-30 00:23:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916083909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:26,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:26,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:26,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333209941] [2023-11-30 00:23:26,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:26,953 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:26,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:26,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:26,954 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 95 [2023-11-30 00:23:26,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 00:23:26,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:26,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 95 [2023-11-30 00:23:26,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:27,063 INFO L124 PetriNetUnfolderBase]: 210/701 cut-off events. [2023-11-30 00:23:27,064 INFO L125 PetriNetUnfolderBase]: For 140/183 co-relation queries the response was YES. [2023-11-30 00:23:27,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 701 events. 210/701 cut-off events. For 140/183 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4083 event pairs, 122 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 1415. Up to 363 conditions per place. [2023-11-30 00:23:27,069 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 47 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2023-11-30 00:23:27,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 444 flow [2023-11-30 00:23:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-30 00:23:27,070 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7859649122807018 [2023-11-30 00:23:27,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-30 00:23:27,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-30 00:23:27,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:27,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-30 00:23:27,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 00:23:27,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 00:23:27,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 00:23:27,075 INFO L307 CegarLoopForPetriNet]: 95 programPoint places, -8 predicate places. [2023-11-30 00:23:27,076 INFO L500 AbstractCegarLoop]: Abstraction has has 87 places, 106 transitions, 444 flow [2023-11-30 00:23:27,076 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 00:23:27,076 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:27,076 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:27,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 00:23:27,076 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-30 00:23:27,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1680372909, now seen corresponding path program 1 times [2023-11-30 00:23:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096581938] [2023-11-30 00:23:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:27,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:23:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:27,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:23:27,103 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:23:27,103 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-30 00:23:27,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-30 00:23:27,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-30 00:23:27,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-30 00:23:27,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-30 00:23:27,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-30 00:23:27,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-30 00:23:27,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-30 00:23:27,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-30 00:23:27,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-30 00:23:27,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 00:23:27,105 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:23:27,105 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:23:27,105 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 00:23:27,121 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:27,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 127 transitions, 272 flow [2023-11-30 00:23:27,137 INFO L124 PetriNetUnfolderBase]: 10/164 cut-off events. [2023-11-30 00:23:27,137 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 00:23:27,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 164 events. 10/164 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 392 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 123. Up to 8 conditions per place. [2023-11-30 00:23:27,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 127 transitions, 272 flow [2023-11-30 00:23:27,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 127 transitions, 272 flow [2023-11-30 00:23:27,142 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:27,144 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;@10fe3e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:27,144 INFO L363 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-30 00:23:27,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:27,149 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2023-11-30 00:23:27,150 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:23:27,150 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:27,150 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] [2023-11-30 00:23:27,150 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:27,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1158823850, now seen corresponding path program 1 times [2023-11-30 00:23:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533889899] [2023-11-30 00:23:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:27,203 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 00:23:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533889899] [2023-11-30 00:23:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533889899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590134157] [2023-11-30 00:23:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:27,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:27,206 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 127 [2023-11-30 00:23:27,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 00:23:27,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:27,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 127 [2023-11-30 00:23:27,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:28,127 INFO L124 PetriNetUnfolderBase]: 4413/9800 cut-off events. [2023-11-30 00:23:28,128 INFO L125 PetriNetUnfolderBase]: For 1159/1159 co-relation queries the response was YES. [2023-11-30 00:23:28,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17494 conditions, 9800 events. 4413/9800 cut-off events. For 1159/1159 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 88586 event pairs, 3508 based on Foata normal form. 3459/11159 useless extension candidates. Maximal degree in co-relation 15345. Up to 6015 conditions per place. [2023-11-30 00:23:28,194 INFO L140 encePairwiseOnDemand]: 109/127 looper letters, 55 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2023-11-30 00:23:28,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 131 transitions, 420 flow [2023-11-30 00:23:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-11-30 00:23:28,196 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.821522309711286 [2023-11-30 00:23:28,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-11-30 00:23:28,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-11-30 00:23:28,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:28,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-11-30 00:23:28,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 00:23:28,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:28,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:28,201 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -13 predicate places. [2023-11-30 00:23:28,201 INFO L500 AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 420 flow [2023-11-30 00:23:28,202 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 00:23:28,202 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:28,202 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] [2023-11-30 00:23:28,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 00:23:28,203 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:28,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -758629932, now seen corresponding path program 1 times [2023-11-30 00:23:28,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038975144] [2023-11-30 00:23:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:28,301 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 00:23:28,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038975144] [2023-11-30 00:23:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038975144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900405620] [2023-11-30 00:23:28,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:28,303 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:28,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:28,304 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 127 [2023-11-30 00:23:28,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 00:23:28,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:28,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 127 [2023-11-30 00:23:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:29,289 INFO L124 PetriNetUnfolderBase]: 5526/11772 cut-off events. [2023-11-30 00:23:29,290 INFO L125 PetriNetUnfolderBase]: For 2584/3758 co-relation queries the response was YES. [2023-11-30 00:23:29,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29054 conditions, 11772 events. 5526/11772 cut-off events. For 2584/3758 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 106383 event pairs, 3716 based on Foata normal form. 0/9314 useless extension candidates. Maximal degree in co-relation 25877. Up to 7271 conditions per place. [2023-11-30 00:23:29,361 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 80 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2023-11-30 00:23:29,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 157 transitions, 712 flow [2023-11-30 00:23:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-11-30 00:23:29,363 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7847769028871391 [2023-11-30 00:23:29,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-11-30 00:23:29,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-11-30 00:23:29,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:29,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-11-30 00:23:29,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 00:23:29,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:29,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:29,367 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -11 predicate places. [2023-11-30 00:23:29,367 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 157 transitions, 712 flow [2023-11-30 00:23:29,367 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 00:23:29,367 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:29,368 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:29,368 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 00:23:29,368 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:29,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:29,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1366380159, now seen corresponding path program 1 times [2023-11-30 00:23:29,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:29,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52428018] [2023-11-30 00:23:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:29,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:29,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52428018] [2023-11-30 00:23:29,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52428018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:29,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:29,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:29,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577986013] [2023-11-30 00:23:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:29,411 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:29,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:29,412 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 127 [2023-11-30 00:23:29,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 157 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 00:23:29,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:29,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 127 [2023-11-30 00:23:29,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:30,683 INFO L124 PetriNetUnfolderBase]: 7187/14724 cut-off events. [2023-11-30 00:23:30,683 INFO L125 PetriNetUnfolderBase]: For 6293/9022 co-relation queries the response was YES. [2023-11-30 00:23:30,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45661 conditions, 14724 events. 7187/14724 cut-off events. For 6293/9022 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 132736 event pairs, 3705 based on Foata normal form. 10/11877 useless extension candidates. Maximal degree in co-relation 41306. Up to 8798 conditions per place. [2023-11-30 00:23:30,780 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 122 selfloop transitions, 19 changer transitions 0/210 dead transitions. [2023-11-30 00:23:30,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 210 transitions, 1329 flow [2023-11-30 00:23:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-11-30 00:23:30,781 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7821522309711286 [2023-11-30 00:23:30,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-11-30 00:23:30,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-11-30 00:23:30,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:30,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-11-30 00:23:30,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 00:23:30,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:30,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:30,784 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -9 predicate places. [2023-11-30 00:23:30,784 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 210 transitions, 1329 flow [2023-11-30 00:23:30,784 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 00:23:30,784 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:30,784 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] [2023-11-30 00:23:30,784 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 00:23:30,784 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:30,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash -225946769, now seen corresponding path program 1 times [2023-11-30 00:23:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:30,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411489106] [2023-11-30 00:23:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:30,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:30,802 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 00:23:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:30,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411489106] [2023-11-30 00:23:30,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411489106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:30,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114785987] [2023-11-30 00:23:30,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:30,803 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:30,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:30,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:30,804 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 127 [2023-11-30 00:23:30,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 210 transitions, 1329 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 00:23:30,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:30,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 127 [2023-11-30 00:23:30,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:32,430 INFO L124 PetriNetUnfolderBase]: 8641/19094 cut-off events. [2023-11-30 00:23:32,431 INFO L125 PetriNetUnfolderBase]: For 15583/20889 co-relation queries the response was YES. [2023-11-30 00:23:32,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68499 conditions, 19094 events. 8641/19094 cut-off events. For 15583/20889 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 189441 event pairs, 2348 based on Foata normal form. 68/16005 useless extension candidates. Maximal degree in co-relation 63165. Up to 10842 conditions per place. [2023-11-30 00:23:32,565 INFO L140 encePairwiseOnDemand]: 112/127 looper letters, 204 selfloop transitions, 40 changer transitions 0/316 dead transitions. [2023-11-30 00:23:32,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 316 transitions, 2698 flow [2023-11-30 00:23:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-30 00:23:32,567 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8162729658792651 [2023-11-30 00:23:32,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-30 00:23:32,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-30 00:23:32,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:32,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-30 00:23:32,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 00:23:32,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:32,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:32,569 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -7 predicate places. [2023-11-30 00:23:32,569 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 316 transitions, 2698 flow [2023-11-30 00:23:32,569 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 00:23:32,569 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:32,569 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:32,570 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 00:23:32,570 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:32,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash -86142850, now seen corresponding path program 1 times [2023-11-30 00:23:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136114501] [2023-11-30 00:23:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:32,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136114501] [2023-11-30 00:23:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136114501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275317668] [2023-11-30 00:23:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:32,589 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:32,590 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 127 [2023-11-30 00:23:32,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 316 transitions, 2698 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 00:23:32,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:32,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 127 [2023-11-30 00:23:32,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:34,543 INFO L124 PetriNetUnfolderBase]: 10463/22375 cut-off events. [2023-11-30 00:23:34,544 INFO L125 PetriNetUnfolderBase]: For 30266/39328 co-relation queries the response was YES. [2023-11-30 00:23:34,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93131 conditions, 22375 events. 10463/22375 cut-off events. For 30266/39328 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 222144 event pairs, 2551 based on Foata normal form. 82/18967 useless extension candidates. Maximal degree in co-relation 86324. Up to 12468 conditions per place. [2023-11-30 00:23:34,709 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 298 selfloop transitions, 31 changer transitions 0/399 dead transitions. [2023-11-30 00:23:34,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 399 transitions, 4206 flow [2023-11-30 00:23:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-11-30 00:23:34,711 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7821522309711286 [2023-11-30 00:23:34,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-11-30 00:23:34,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-11-30 00:23:34,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:34,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-11-30 00:23:34,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 00:23:34,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:34,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:34,713 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -5 predicate places. [2023-11-30 00:23:34,713 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 399 transitions, 4206 flow [2023-11-30 00:23:34,713 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 00:23:34,713 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:34,713 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:34,713 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 00:23:34,713 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:34,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash -559575293, now seen corresponding path program 1 times [2023-11-30 00:23:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:34,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125545066] [2023-11-30 00:23:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:34,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:23:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125545066] [2023-11-30 00:23:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125545066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 00:23:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252960115] [2023-11-30 00:23:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:34,774 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:34,775 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2023-11-30 00:23:34,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 399 transitions, 4206 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 00:23:34,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:34,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2023-11-30 00:23:34,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:34,825 INFO L124 PetriNetUnfolderBase]: 65/486 cut-off events. [2023-11-30 00:23:34,825 INFO L125 PetriNetUnfolderBase]: For 2685/2753 co-relation queries the response was YES. [2023-11-30 00:23:34,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 486 events. 65/486 cut-off events. For 2685/2753 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2708 event pairs, 19 based on Foata normal form. 146/603 useless extension candidates. Maximal degree in co-relation 533. Up to 203 conditions per place. [2023-11-30 00:23:34,826 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 21 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2023-11-30 00:23:34,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 870 flow [2023-11-30 00:23:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-30 00:23:34,828 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.847769028871391 [2023-11-30 00:23:34,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-30 00:23:34,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-30 00:23:34,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:34,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-30 00:23:34,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 00:23:34,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:34,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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 00:23:34,830 INFO L307 CegarLoopForPetriNet]: 127 programPoint places, -10 predicate places. [2023-11-30 00:23:34,830 INFO L500 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 870 flow [2023-11-30 00:23:34,830 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 00:23:34,831 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:34,831 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:34,831 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 00:23:34,831 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2023-11-30 00:23:34,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1622906571, now seen corresponding path program 1 times [2023-11-30 00:23:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091482171] [2023-11-30 00:23:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:34,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:23:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:23:34,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:23:34,857 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:23:34,857 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-30 00:23:34,857 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-30 00:23:34,857 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-30 00:23:34,857 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-30 00:23:34,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-30 00:23:34,858 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 00:23:34,858 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:23:34,859 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:23:34,859 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 00:23:34,889 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:23:34,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 159 transitions, 346 flow [2023-11-30 00:23:34,906 INFO L124 PetriNetUnfolderBase]: 13/209 cut-off events. [2023-11-30 00:23:34,906 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 00:23:34,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 209 events. 13/209 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 564 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 172. Up to 10 conditions per place. [2023-11-30 00:23:34,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 159 transitions, 346 flow [2023-11-30 00:23:34,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 159 transitions, 346 flow [2023-11-30 00:23:34,909 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:23:34,911 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;@10fe3e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:23:34,911 INFO L363 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-30 00:23:34,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:23:34,912 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:23:34,912 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:23:34,912 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:34,912 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] [2023-11-30 00:23:34,912 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:23:34,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash 782752137, now seen corresponding path program 1 times [2023-11-30 00:23:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:34,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675943041] [2023-11-30 00:23:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:23:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675943041] [2023-11-30 00:23:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675943041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998095597] [2023-11-30 00:23:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:34,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:34,930 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 159 [2023-11-30 00:23:34,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 159 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 00:23:34,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:34,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 159 [2023-11-30 00:23:34,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:23:45,379 INFO L124 PetriNetUnfolderBase]: 80937/146163 cut-off events. [2023-11-30 00:23:45,380 INFO L125 PetriNetUnfolderBase]: For 24082/24082 co-relation queries the response was YES. [2023-11-30 00:23:45,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269466 conditions, 146163 events. 80937/146163 cut-off events. For 24082/24082 co-relation queries the response was YES. Maximal size of possible extension queue 4041. Compared 1581638 event pairs, 66334 based on Foata normal form. 46442/159776 useless extension candidates. Maximal degree in co-relation 235930. Up to 97787 conditions per place. [2023-11-30 00:23:46,691 INFO L140 encePairwiseOnDemand]: 136/159 looper letters, 76 selfloop transitions, 12 changer transitions 0/170 dead transitions. [2023-11-30 00:23:46,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 170 transitions, 565 flow [2023-11-30 00:23:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:23:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:23:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-30 00:23:46,693 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8218029350104822 [2023-11-30 00:23:46,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-30 00:23:46,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-30 00:23:46,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:23:46,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-30 00:23:46,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 00:23:46,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:23:46,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:23:46,695 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -16 predicate places. [2023-11-30 00:23:46,695 INFO L500 AbstractCegarLoop]: Abstraction has has 143 places, 170 transitions, 565 flow [2023-11-30 00:23:46,696 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 00:23:46,696 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:23:46,696 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] [2023-11-30 00:23:46,696 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 00:23:46,696 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:23:46,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:23:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 992060563, now seen corresponding path program 1 times [2023-11-30 00:23:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:23:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887547957] [2023-11-30 00:23:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:23:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:23:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:23:46,713 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 00:23:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:23:46,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887547957] [2023-11-30 00:23:46,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887547957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:23:46,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:23:46,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:23:46,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613252992] [2023-11-30 00:23:46,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:23:46,714 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:23:46,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:23:46,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:23:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:23:46,714 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 159 [2023-11-30 00:23:46,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 170 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 00:23:46,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:23:46,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 159 [2023-11-30 00:23:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:24:00,808 INFO L124 PetriNetUnfolderBase]: 101550/178789 cut-off events. [2023-11-30 00:24:00,809 INFO L125 PetriNetUnfolderBase]: For 43656/60740 co-relation queries the response was YES. [2023-11-30 00:24:01,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461072 conditions, 178789 events. 101550/178789 cut-off events. For 43656/60740 co-relation queries the response was YES. Maximal size of possible extension queue 4753. Compared 1923756 event pairs, 72344 based on Foata normal form. 0/139492 useless extension candidates. Maximal degree in co-relation 409172. Up to 120255 conditions per place. [2023-11-30 00:24:02,619 INFO L140 encePairwiseOnDemand]: 146/159 looper letters, 113 selfloop transitions, 12 changer transitions 0/208 dead transitions. [2023-11-30 00:24:02,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 208 transitions, 986 flow [2023-11-30 00:24:02,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:24:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:24:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-30 00:24:02,620 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7840670859538784 [2023-11-30 00:24:02,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-30 00:24:02,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-30 00:24:02,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:24:02,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-30 00:24:02,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 00:24:02,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:24:02,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:24:02,623 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -14 predicate places. [2023-11-30 00:24:02,623 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 208 transitions, 986 flow [2023-11-30 00:24:02,624 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 00:24:02,624 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:24:02,624 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:24:02,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 00:24:02,624 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:24:02,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:24:02,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1308563870, now seen corresponding path program 1 times [2023-11-30 00:24:02,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:24:02,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98134513] [2023-11-30 00:24:02,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:24:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:24:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:24:02,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:24:02,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:24:02,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98134513] [2023-11-30 00:24:02,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98134513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:24:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:24:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:24:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209417826] [2023-11-30 00:24:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:24:02,641 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:24:02,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:24:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:24:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:24:02,642 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 159 [2023-11-30 00:24:02,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 208 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 00:24:02,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:24:02,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 159 [2023-11-30 00:24:02,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:24:22,588 INFO L124 PetriNetUnfolderBase]: 134905/231006 cut-off events. [2023-11-30 00:24:22,588 INFO L125 PetriNetUnfolderBase]: For 95232/159510 co-relation queries the response was YES. [2023-11-30 00:24:23,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755932 conditions, 231006 events. 134905/231006 cut-off events. For 95232/159510 co-relation queries the response was YES. Maximal size of possible extension queue 5810. Compared 2468740 event pairs, 76030 based on Foata normal form. 154/182632 useless extension candidates. Maximal degree in co-relation 676739. Up to 151175 conditions per place. [2023-11-30 00:24:25,319 INFO L140 encePairwiseOnDemand]: 146/159 looper letters, 185 selfloop transitions, 28 changer transitions 0/297 dead transitions. [2023-11-30 00:24:25,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 297 transitions, 1990 flow [2023-11-30 00:24:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:24:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:24:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-11-30 00:24:25,320 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7819706498951782 [2023-11-30 00:24:25,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-11-30 00:24:25,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-11-30 00:24:25,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:24:25,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-11-30 00:24:25,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 00:24:25,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:24:25,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:24:25,322 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -12 predicate places. [2023-11-30 00:24:25,323 INFO L500 AbstractCegarLoop]: Abstraction has has 147 places, 297 transitions, 1990 flow [2023-11-30 00:24:25,323 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 00:24:25,323 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:24:25,323 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] [2023-11-30 00:24:25,323 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 00:24:25,323 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:24:25,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:24:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 806903118, now seen corresponding path program 1 times [2023-11-30 00:24:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:24:25,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772336836] [2023-11-30 00:24:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:24:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:24:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:24:25,338 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 00:24:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:24:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772336836] [2023-11-30 00:24:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772336836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:24:25,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:24:25,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:24:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388734471] [2023-11-30 00:24:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:24:25,339 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:24:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:24:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:24:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:24:25,339 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 159 [2023-11-30 00:24:25,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 297 transitions, 1990 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 00:24:25,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:24:25,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 159 [2023-11-30 00:24:25,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:25:03,169 INFO L124 PetriNetUnfolderBase]: 188104/348758 cut-off events. [2023-11-30 00:25:03,170 INFO L125 PetriNetUnfolderBase]: For 254616/409483 co-relation queries the response was YES. [2023-11-30 00:25:04,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317091 conditions, 348758 events. 188104/348758 cut-off events. For 254616/409483 co-relation queries the response was YES. Maximal size of possible extension queue 9232. Compared 4226656 event pairs, 50139 based on Foata normal form. 992/285902 useless extension candidates. Maximal degree in co-relation 1200294. Up to 214611 conditions per place. [2023-11-30 00:25:07,936 INFO L140 encePairwiseOnDemand]: 139/159 looper letters, 330 selfloop transitions, 68 changer transitions 0/485 dead transitions. [2023-11-30 00:25:07,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 485 transitions, 4377 flow [2023-11-30 00:25:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:25:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:25:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-30 00:25:07,949 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8092243186582809 [2023-11-30 00:25:07,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-30 00:25:07,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-30 00:25:07,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:25:07,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-30 00:25:07,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:25:07,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:25:07,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:25:07,951 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -10 predicate places. [2023-11-30 00:25:07,951 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 485 transitions, 4377 flow [2023-11-30 00:25:07,951 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 00:25:07,951 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:25:07,951 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:25:07,951 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 00:25:07,951 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:25:07,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:25:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1978372605, now seen corresponding path program 1 times [2023-11-30 00:25:07,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:25:07,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140767679] [2023-11-30 00:25:07,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:25:07,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:25:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:25:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:25:07,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:25:07,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140767679] [2023-11-30 00:25:07,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140767679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:25:07,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:25:07,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:25:07,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928428019] [2023-11-30 00:25:07,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:25:07,970 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:25:07,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:25:07,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:25:07,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:25:07,970 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 159 [2023-11-30 00:25:07,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 485 transitions, 4377 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 00:25:07,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:25:07,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 159 [2023-11-30 00:25:07,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:26:04,567 INFO L124 PetriNetUnfolderBase]: 230977/420804 cut-off events. [2023-11-30 00:26:04,568 INFO L125 PetriNetUnfolderBase]: For 494287/777774 co-relation queries the response was YES. [2023-11-30 00:26:06,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845941 conditions, 420804 events. 230977/420804 cut-off events. For 494287/777774 co-relation queries the response was YES. Maximal size of possible extension queue 10913. Compared 5108587 event pairs, 55634 based on Foata normal form. 1558/348271 useless extension candidates. Maximal degree in co-relation 1688539. Up to 253933 conditions per place. [2023-11-30 00:26:11,592 INFO L140 encePairwiseOnDemand]: 146/159 looper letters, 513 selfloop transitions, 55 changer transitions 0/653 dead transitions. [2023-11-30 00:26:11,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 653 transitions, 7267 flow [2023-11-30 00:26:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:26:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:26:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-11-30 00:26:11,613 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7819706498951782 [2023-11-30 00:26:11,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-11-30 00:26:11,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-11-30 00:26:11,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:26:11,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-11-30 00:26:11,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 00:26:11,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:11,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:11,615 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -8 predicate places. [2023-11-30 00:26:11,615 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 653 transitions, 7267 flow [2023-11-30 00:26:11,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 00:26:11,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:26:11,616 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:26:11,616 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 00:26:11,616 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:26:11,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:26:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1058534814, now seen corresponding path program 1 times [2023-11-30 00:26:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:26:11,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249914692] [2023-11-30 00:26:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:26:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:26:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:26:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:26:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:26:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249914692] [2023-11-30 00:26:11,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249914692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:26:11,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:26:11,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 00:26:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434926399] [2023-11-30 00:26:11,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:26:11,729 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:26:11,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:26:11,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:26:11,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:26:11,730 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 159 [2023-11-30 00:26:11,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 653 transitions, 7267 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:26:11,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:26:11,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 159 [2023-11-30 00:26:11,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:26:11,941 INFO L124 PetriNetUnfolderBase]: 213/1293 cut-off events. [2023-11-30 00:26:11,941 INFO L125 PetriNetUnfolderBase]: For 8517/8640 co-relation queries the response was YES. [2023-11-30 00:26:11,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1293 events. 213/1293 cut-off events. For 8517/8640 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 9843 event pairs, 7 based on Foata normal form. 626/1822 useless extension candidates. Maximal degree in co-relation 2263. Up to 615 conditions per place. [2023-11-30 00:26:11,947 INFO L140 encePairwiseOnDemand]: 151/159 looper letters, 29 selfloop transitions, 12 changer transitions 0/151 dead transitions. [2023-11-30 00:26:11,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 151 transitions, 1235 flow [2023-11-30 00:26:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:26:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:26:11,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-30 00:26:11,949 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8511530398322851 [2023-11-30 00:26:11,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-30 00:26:11,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-30 00:26:11,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:26:11,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-30 00:26:11,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 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 00:26:11,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:11,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:11,951 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -14 predicate places. [2023-11-30 00:26:11,951 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 151 transitions, 1235 flow [2023-11-30 00:26:11,951 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:26:11,951 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:26:11,951 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:26:11,951 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 00:26:11,951 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:26:11,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:26:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1671901014, now seen corresponding path program 1 times [2023-11-30 00:26:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:26:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331142701] [2023-11-30 00:26:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:26:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:26:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:26:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 00:26:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:26:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331142701] [2023-11-30 00:26:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331142701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:26:11,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:26:11,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:26:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035362201] [2023-11-30 00:26:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:26:11,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:26:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:26:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:26:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:26:11,987 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 159 [2023-11-30 00:26:11,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 151 transitions, 1235 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 00:26:11,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:26:11,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 159 [2023-11-30 00:26:11,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:26:12,132 INFO L124 PetriNetUnfolderBase]: 217/1285 cut-off events. [2023-11-30 00:26:12,132 INFO L125 PetriNetUnfolderBase]: For 7900/8063 co-relation queries the response was YES. [2023-11-30 00:26:12,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 1285 events. 217/1285 cut-off events. For 7900/8063 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9819 event pairs, 7 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 2511. Up to 611 conditions per place. [2023-11-30 00:26:12,138 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 66 selfloop transitions, 3 changer transitions 0/151 dead transitions. [2023-11-30 00:26:12,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 151 transitions, 1384 flow [2023-11-30 00:26:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:26:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:26:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-11-30 00:26:12,140 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6876310272536688 [2023-11-30 00:26:12,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-11-30 00:26:12,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-11-30 00:26:12,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:26:12,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-11-30 00:26:12,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 00:26:12,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:12,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:12,142 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -13 predicate places. [2023-11-30 00:26:12,142 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 151 transitions, 1384 flow [2023-11-30 00:26:12,142 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 00:26:12,142 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:26:12,142 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:26:12,142 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 00:26:12,142 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:26:12,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:26:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1925437100, now seen corresponding path program 1 times [2023-11-30 00:26:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:26:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115784368] [2023-11-30 00:26:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:26:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:26:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:26:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-30 00:26:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:26:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115784368] [2023-11-30 00:26:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115784368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:26:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:26:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:26:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244871963] [2023-11-30 00:26:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:26:12,164 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:26:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:26:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:26:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:26:12,165 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 159 [2023-11-30 00:26:12,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 151 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 00:26:12,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:26:12,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 159 [2023-11-30 00:26:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:26:12,380 INFO L124 PetriNetUnfolderBase]: 221/1277 cut-off events. [2023-11-30 00:26:12,380 INFO L125 PetriNetUnfolderBase]: For 10098/10307 co-relation queries the response was YES. [2023-11-30 00:26:12,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6963 conditions, 1277 events. 221/1277 cut-off events. For 10098/10307 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9690 event pairs, 7 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 2743. Up to 603 conditions per place. [2023-11-30 00:26:12,410 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 67 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2023-11-30 00:26:12,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 151 transitions, 1533 flow [2023-11-30 00:26:12,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 00:26:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 00:26:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-30 00:26:12,411 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6855345911949685 [2023-11-30 00:26:12,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-30 00:26:12,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-30 00:26:12,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:26:12,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-30 00:26:12,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 00:26:12,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:12,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 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 00:26:12,428 INFO L307 CegarLoopForPetriNet]: 159 programPoint places, -12 predicate places. [2023-11-30 00:26:12,428 INFO L500 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 1533 flow [2023-11-30 00:26:12,428 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 00:26:12,428 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:26:12,429 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 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 00:26:12,429 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 00:26:12,429 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-30 00:26:12,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:26:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash -329493782, now seen corresponding path program 1 times [2023-11-30 00:26:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:26:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253075467] [2023-11-30 00:26:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:26:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:26:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:26:12,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:26:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:26:12,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:26:12,474 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:26:12,474 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-11-30 00:26:12,474 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-11-30 00:26:12,475 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-11-30 00:26:12,476 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 00:26:12,476 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:26:12,476 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:26:12,476 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 00:26:12,517 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:26:12,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 191 transitions, 422 flow [2023-11-30 00:26:12,545 INFO L124 PetriNetUnfolderBase]: 16/254 cut-off events. [2023-11-30 00:26:12,546 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 00:26:12,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 254 events. 16/254 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 742 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 222. Up to 12 conditions per place. [2023-11-30 00:26:12,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 191 transitions, 422 flow [2023-11-30 00:26:12,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 191 transitions, 422 flow [2023-11-30 00:26:12,549 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:26:12,549 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;@10fe3e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:26:12,549 INFO L363 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-30 00:26:12,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:26:12,552 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-30 00:26:12,552 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:26:12,552 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:26:12,552 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] [2023-11-30 00:26:12,552 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2023-11-30 00:26:12,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:26:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1970903690, now seen corresponding path program 1 times [2023-11-30 00:26:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:26:12,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097994042] [2023-11-30 00:26:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:26:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:26:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:26:12,571 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 00:26:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:26:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097994042] [2023-11-30 00:26:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097994042] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:26:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:26:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 00:26:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349349893] [2023-11-30 00:26:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:26:12,572 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 00:26:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:26:12,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 00:26:12,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 00:26:12,573 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 191 [2023-11-30 00:26:12,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 00:26:12,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:26:12,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 191 [2023-11-30 00:26:12,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand