/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:26:14,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:26:14,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:26:14,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:26:14,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:26:14,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:26:14,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:26:14,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:26:14,274 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:26:14,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:26:14,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:26:14,277 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:26:14,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:26:14,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:26:14,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:26:14,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:26:14,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:26:14,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:26:14,279 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:26:14,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:26:14,279 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:26:14,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:26:14,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:26:14,280 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:26:14,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:26:14,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:26:14,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:26:14,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:26:14,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:26:14,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:26:14,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:26:14,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:26:14,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:26:14,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:26:14,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:26:14,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:26:14,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:26:14,483 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:26:14,483 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:26:14,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2023-11-30 03:26:15,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:26:15,700 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:26:15,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2023-11-30 03:26:15,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed680e7b/299faffb3e784edbbcfeb5f748e1459f/FLAG0338e89c4 [2023-11-30 03:26:15,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed680e7b/299faffb3e784edbbcfeb5f748e1459f [2023-11-30 03:26:15,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:26:15,723 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:26:15,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:26:15,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:26:15,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:26:15,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1524551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15, skipping insertion in model container [2023-11-30 03:26:15,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:26:15,859 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:26:15,868 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:26:15,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:26:15,894 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:26:15,894 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:26:15,899 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:26:15,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15 WrapperNode [2023-11-30 03:26:15,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:26:15,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:26:15,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:26:15,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:26:15,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,933 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 242 [2023-11-30 03:26:15,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:26:15,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:26:15,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:26:15,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:26:15,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:26:15,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:26:15,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:26:15,961 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:26:15,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (1/1) ... [2023-11-30 03:26:15,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:26:15,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:26:15,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:26:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:26:16,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:26:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:26:16,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:26:16,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:26:16,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:26:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:26:16,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:26:16,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:26:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:26:16,009 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:26:16,109 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:26:16,111 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:26:16,513 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:26:16,706 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:26:16,706 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 03:26:16,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:26:16 BoogieIcfgContainer [2023-11-30 03:26:16,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:26:16,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:26:16,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:26:16,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:26:16,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:26:15" (1/3) ... [2023-11-30 03:26:16,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be346a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:26:16, skipping insertion in model container [2023-11-30 03:26:16,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:26:15" (2/3) ... [2023-11-30 03:26:16,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be346a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:26:16, skipping insertion in model container [2023-11-30 03:26:16,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:26:16" (3/3) ... [2023-11-30 03:26:16,715 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2023-11-30 03:26:16,727 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:26:16,727 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-30 03:26:16,727 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:26:16,780 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:26:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 199 transitions, 412 flow [2023-11-30 03:26:16,884 INFO L124 PetriNetUnfolderBase]: 9/197 cut-off events. [2023-11-30 03:26:16,885 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:26:16,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 197 events. 9/197 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 209 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2023-11-30 03:26:16,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 199 transitions, 412 flow [2023-11-30 03:26:16,895 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 176 transitions, 364 flow [2023-11-30 03:26:16,904 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:26:16,909 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;@33a3e6b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:26:16,910 INFO L363 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-11-30 03:26:16,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:26:16,914 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-30 03:26:16,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:26:16,915 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:16,915 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:16,916 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:16,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1865418986, now seen corresponding path program 1 times [2023-11-30 03:26:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873844034] [2023-11-30 03:26:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:17,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873844034] [2023-11-30 03:26:17,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873844034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:17,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:17,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005024953] [2023-11-30 03:26:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:17,095 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:17,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:17,124 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2023-11-30 03:26:17,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 176 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:17,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2023-11-30 03:26:17,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:17,205 INFO L124 PetriNetUnfolderBase]: 10/182 cut-off events. [2023-11-30 03:26:17,206 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2023-11-30 03:26:17,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 182 events. 10/182 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 12/177 useless extension candidates. Maximal degree in co-relation 128. Up to 22 conditions per place. [2023-11-30 03:26:17,209 INFO L140 encePairwiseOnDemand]: 172/199 looper letters, 11 selfloop transitions, 2 changer transitions 2/151 dead transitions. [2023-11-30 03:26:17,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 340 flow [2023-11-30 03:26:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-30 03:26:17,223 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8525963149078727 [2023-11-30 03:26:17,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-30 03:26:17,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-30 03:26:17,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:17,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-30 03:26:17,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,240 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -18 predicate places. [2023-11-30 03:26:17,241 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 340 flow [2023-11-30 03:26:17,241 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,241 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:17,242 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] [2023-11-30 03:26:17,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:26:17,242 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:17,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash 698432545, now seen corresponding path program 1 times [2023-11-30 03:26:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294392884] [2023-11-30 03:26:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:17,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:17,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294392884] [2023-11-30 03:26:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294392884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:17,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418203107] [2023-11-30 03:26:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:17,306 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:17,309 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2023-11-30 03:26:17,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:17,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2023-11-30 03:26:17,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:17,359 INFO L124 PetriNetUnfolderBase]: 10/181 cut-off events. [2023-11-30 03:26:17,359 INFO L125 PetriNetUnfolderBase]: For 45/51 co-relation queries the response was YES. [2023-11-30 03:26:17,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 181 events. 10/181 cut-off events. For 45/51 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 137. Up to 23 conditions per place. [2023-11-30 03:26:17,361 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 2/150 dead transitions. [2023-11-30 03:26:17,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 150 transitions, 366 flow [2023-11-30 03:26:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-11-30 03:26:17,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8140703517587939 [2023-11-30 03:26:17,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-11-30 03:26:17,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-11-30 03:26:17,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:17,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-11-30 03:26:17,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,367 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -17 predicate places. [2023-11-30 03:26:17,368 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 150 transitions, 366 flow [2023-11-30 03:26:17,368 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,368 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:17,368 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 03:26:17,369 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:26:17,369 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:17,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1661466328, now seen corresponding path program 1 times [2023-11-30 03:26:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488420583] [2023-11-30 03:26:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488420583] [2023-11-30 03:26:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488420583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844170003] [2023-11-30 03:26:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:17,435 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:17,436 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2023-11-30 03:26:17,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 150 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:17,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2023-11-30 03:26:17,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:17,477 INFO L124 PetriNetUnfolderBase]: 10/180 cut-off events. [2023-11-30 03:26:17,477 INFO L125 PetriNetUnfolderBase]: For 85/95 co-relation queries the response was YES. [2023-11-30 03:26:17,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 180 events. 10/180 cut-off events. For 85/95 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 146. Up to 23 conditions per place. [2023-11-30 03:26:17,480 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 2/149 dead transitions. [2023-11-30 03:26:17,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 149 transitions, 392 flow [2023-11-30 03:26:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-11-30 03:26:17,481 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8140703517587939 [2023-11-30 03:26:17,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-11-30 03:26:17,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-11-30 03:26:17,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:17,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-11-30 03:26:17,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,486 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -16 predicate places. [2023-11-30 03:26:17,487 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 149 transitions, 392 flow [2023-11-30 03:26:17,487 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,487 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:17,487 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:17,487 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:26:17,487 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:17,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:17,488 INFO L85 PathProgramCache]: Analyzing trace with hash 522852378, now seen corresponding path program 1 times [2023-11-30 03:26:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:17,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912569577] [2023-11-30 03:26:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:17,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912569577] [2023-11-30 03:26:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912569577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:17,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382316757] [2023-11-30 03:26:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:17,530 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:17,531 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 199 [2023-11-30 03:26:17,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 149 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:17,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 199 [2023-11-30 03:26:17,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:17,586 INFO L124 PetriNetUnfolderBase]: 11/192 cut-off events. [2023-11-30 03:26:17,586 INFO L125 PetriNetUnfolderBase]: For 157/183 co-relation queries the response was YES. [2023-11-30 03:26:17,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 192 events. 11/192 cut-off events. For 157/183 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 259 event pairs, 0 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 150. Up to 27 conditions per place. [2023-11-30 03:26:17,587 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 12 selfloop transitions, 2 changer transitions 2/152 dead transitions. [2023-11-30 03:26:17,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 152 transitions, 454 flow [2023-11-30 03:26:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2023-11-30 03:26:17,589 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8341708542713567 [2023-11-30 03:26:17,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2023-11-30 03:26:17,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2023-11-30 03:26:17,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:17,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2023-11-30 03:26:17,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,593 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -15 predicate places. [2023-11-30 03:26:17,593 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 152 transitions, 454 flow [2023-11-30 03:26:17,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,594 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:17,594 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:17,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:26:17,594 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:17,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -818148839, now seen corresponding path program 1 times [2023-11-30 03:26:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014739512] [2023-11-30 03:26:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014739512] [2023-11-30 03:26:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014739512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:17,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:17,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:17,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442815744] [2023-11-30 03:26:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:17,647 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:17,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:17,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:17,649 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 199 [2023-11-30 03:26:17,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 152 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:17,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 199 [2023-11-30 03:26:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:17,690 INFO L124 PetriNetUnfolderBase]: 11/192 cut-off events. [2023-11-30 03:26:17,691 INFO L125 PetriNetUnfolderBase]: For 209/234 co-relation queries the response was YES. [2023-11-30 03:26:17,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 192 events. 11/192 cut-off events. For 209/234 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 250 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 156. Up to 27 conditions per place. [2023-11-30 03:26:17,692 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 13 selfloop transitions, 2 changer transitions 2/151 dead transitions. [2023-11-30 03:26:17,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 151 transitions, 482 flow [2023-11-30 03:26:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-11-30 03:26:17,693 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8241206030150754 [2023-11-30 03:26:17,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-11-30 03:26:17,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-11-30 03:26:17,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:17,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-11-30 03:26:17,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,699 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -14 predicate places. [2023-11-30 03:26:17,699 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 151 transitions, 482 flow [2023-11-30 03:26:17,699 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,700 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:17,700 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:17,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:26:17,700 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:17,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash 467950519, now seen corresponding path program 1 times [2023-11-30 03:26:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710113911] [2023-11-30 03:26:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:17,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710113911] [2023-11-30 03:26:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710113911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:17,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:17,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:17,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448548087] [2023-11-30 03:26:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:17,752 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:17,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:17,756 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 199 [2023-11-30 03:26:17,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 151 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:17,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 199 [2023-11-30 03:26:17,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:17,796 INFO L124 PetriNetUnfolderBase]: 11/190 cut-off events. [2023-11-30 03:26:17,796 INFO L125 PetriNetUnfolderBase]: For 329/379 co-relation queries the response was YES. [2023-11-30 03:26:17,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 190 events. 11/190 cut-off events. For 329/379 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 255 event pairs, 0 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 163. Up to 27 conditions per place. [2023-11-30 03:26:17,798 INFO L140 encePairwiseOnDemand]: 197/199 looper letters, 13 selfloop transitions, 1 changer transitions 2/150 dead transitions. [2023-11-30 03:26:17,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 150 transitions, 506 flow [2023-11-30 03:26:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2023-11-30 03:26:17,800 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8274706867671692 [2023-11-30 03:26:17,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2023-11-30 03:26:17,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2023-11-30 03:26:17,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:17,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2023-11-30 03:26:17,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,803 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,806 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -13 predicate places. [2023-11-30 03:26:17,806 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 506 flow [2023-11-30 03:26:17,806 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:17,806 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:17,807 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:17,807 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:26:17,807 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:17,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1254471521, now seen corresponding path program 1 times [2023-11-30 03:26:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250516566] [2023-11-30 03:26:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250516566] [2023-11-30 03:26:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250516566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:18,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:26:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815709187] [2023-11-30 03:26:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:18,236 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:26:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:26:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:26:18,238 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 199 [2023-11-30 03:26:18,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:18,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 199 [2023-11-30 03:26:18,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:18,462 INFO L124 PetriNetUnfolderBase]: 71/301 cut-off events. [2023-11-30 03:26:18,463 INFO L125 PetriNetUnfolderBase]: For 1780/1790 co-relation queries the response was YES. [2023-11-30 03:26:18,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 301 events. 71/301 cut-off events. For 1780/1790 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 790 event pairs, 24 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 745. Up to 129 conditions per place. [2023-11-30 03:26:18,465 INFO L140 encePairwiseOnDemand]: 193/199 looper letters, 35 selfloop transitions, 5 changer transitions 2/149 dead transitions. [2023-11-30 03:26:18,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 149 transitions, 584 flow [2023-11-30 03:26:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:26:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:26:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2023-11-30 03:26:18,467 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7144053601340034 [2023-11-30 03:26:18,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2023-11-30 03:26:18,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2023-11-30 03:26:18,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:18,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2023-11-30 03:26:18,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,471 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,472 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -9 predicate places. [2023-11-30 03:26:18,472 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 149 transitions, 584 flow [2023-11-30 03:26:18,472 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,472 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:18,472 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:18,472 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:26:18,472 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:18,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 899921739, now seen corresponding path program 1 times [2023-11-30 03:26:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044973741] [2023-11-30 03:26:18,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044973741] [2023-11-30 03:26:18,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044973741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:18,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:18,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:18,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191307549] [2023-11-30 03:26:18,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:18,541 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:18,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:18,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:18,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:18,542 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 199 [2023-11-30 03:26:18,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 149 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:18,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 199 [2023-11-30 03:26:18,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:18,636 INFO L124 PetriNetUnfolderBase]: 71/300 cut-off events. [2023-11-30 03:26:18,636 INFO L125 PetriNetUnfolderBase]: For 2371/2381 co-relation queries the response was YES. [2023-11-30 03:26:18,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 300 events. 71/300 cut-off events. For 2371/2381 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 794 event pairs, 24 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 819. Up to 129 conditions per place. [2023-11-30 03:26:18,639 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 13 selfloop transitions, 2 changer transitions 2/148 dead transitions. [2023-11-30 03:26:18,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 148 transitions, 612 flow [2023-11-30 03:26:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-11-30 03:26:18,657 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8241206030150754 [2023-11-30 03:26:18,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-11-30 03:26:18,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-11-30 03:26:18,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:18,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-11-30 03:26:18,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,660 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -8 predicate places. [2023-11-30 03:26:18,660 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 148 transitions, 612 flow [2023-11-30 03:26:18,660 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:18,660 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:18,660 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:18,660 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:26:18,660 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:18,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash 170771040, now seen corresponding path program 1 times [2023-11-30 03:26:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126129749] [2023-11-30 03:26:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:19,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:19,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126129749] [2023-11-30 03:26:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126129749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:26:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656395910] [2023-11-30 03:26:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:19,190 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:26:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:26:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:26:19,192 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2023-11-30 03:26:19,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 148 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:19,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2023-11-30 03:26:19,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:19,338 INFO L124 PetriNetUnfolderBase]: 71/280 cut-off events. [2023-11-30 03:26:19,338 INFO L125 PetriNetUnfolderBase]: For 2207/2222 co-relation queries the response was YES. [2023-11-30 03:26:19,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 280 events. 71/280 cut-off events. For 2207/2222 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 680 event pairs, 3 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 905. Up to 125 conditions per place. [2023-11-30 03:26:19,341 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 42 selfloop transitions, 4 changer transitions 2/163 dead transitions. [2023-11-30 03:26:19,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 163 transitions, 988 flow [2023-11-30 03:26:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:26:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:26:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 887 transitions. [2023-11-30 03:26:19,343 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7428810720268006 [2023-11-30 03:26:19,346 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 887 transitions. [2023-11-30 03:26:19,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 887 transitions. [2023-11-30 03:26:19,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:19,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 887 transitions. [2023-11-30 03:26:19,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,349 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,350 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, -4 predicate places. [2023-11-30 03:26:19,350 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 988 flow [2023-11-30 03:26:19,350 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,350 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:19,350 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:19,350 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:26:19,350 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:19,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1284376869, now seen corresponding path program 1 times [2023-11-30 03:26:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714087407] [2023-11-30 03:26:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714087407] [2023-11-30 03:26:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714087407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:19,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:19,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:26:19,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112957781] [2023-11-30 03:26:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:19,798 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:26:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:19,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:26:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:26:19,800 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 199 [2023-11-30 03:26:19,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 988 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:19,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 199 [2023-11-30 03:26:19,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:19,907 INFO L124 PetriNetUnfolderBase]: 73/291 cut-off events. [2023-11-30 03:26:19,908 INFO L125 PetriNetUnfolderBase]: For 2626/2680 co-relation queries the response was YES. [2023-11-30 03:26:19,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 291 events. 73/291 cut-off events. For 2626/2680 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 783 event pairs, 4 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 832. Up to 126 conditions per place. [2023-11-30 03:26:19,910 INFO L140 encePairwiseOnDemand]: 194/199 looper letters, 49 selfloop transitions, 4 changer transitions 2/170 dead transitions. [2023-11-30 03:26:19,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 1248 flow [2023-11-30 03:26:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:26:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:26:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2023-11-30 03:26:19,912 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7386934673366834 [2023-11-30 03:26:19,912 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 882 transitions. [2023-11-30 03:26:19,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 882 transitions. [2023-11-30 03:26:19,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:19,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 882 transitions. [2023-11-30 03:26:19,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,916 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,916 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, 0 predicate places. [2023-11-30 03:26:19,916 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 1248 flow [2023-11-30 03:26:19,917 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,917 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:26:19,917 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:19,917 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:26:19,917 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-11-30 03:26:19,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:26:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1958237599, now seen corresponding path program 1 times [2023-11-30 03:26:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:26:19,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715358208] [2023-11-30 03:26:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:26:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:26:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:26:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:26:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:26:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715358208] [2023-11-30 03:26:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715358208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:26:19,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:26:19,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:26:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633814182] [2023-11-30 03:26:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:26:19,955 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:26:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:26:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:26:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:26:19,955 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 199 [2023-11-30 03:26:19,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 1248 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:19,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:26:19,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 199 [2023-11-30 03:26:19,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:26:19,997 INFO L124 PetriNetUnfolderBase]: 73/275 cut-off events. [2023-11-30 03:26:19,997 INFO L125 PetriNetUnfolderBase]: For 3252/3284 co-relation queries the response was YES. [2023-11-30 03:26:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 275 events. 73/275 cut-off events. For 3252/3284 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 686 event pairs, 4 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 879. Up to 126 conditions per place. [2023-11-30 03:26:19,998 INFO L140 encePairwiseOnDemand]: 197/199 looper letters, 0 selfloop transitions, 0 changer transitions 169/169 dead transitions. [2023-11-30 03:26:19,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 169 transitions, 1318 flow [2023-11-30 03:26:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:26:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:26:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-11-30 03:26:20,000 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8257956448911222 [2023-11-30 03:26:20,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-11-30 03:26:20,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-11-30 03:26:20,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:26:20,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-11-30 03:26:20,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:20,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:20,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:20,003 INFO L307 CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places. [2023-11-30 03:26:20,003 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 1318 flow [2023-11-30 03:26:20,004 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:26:20,010 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-simple-queue.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:26:20,048 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2023-11-30 03:26:20,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-11-30 03:26:20,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-11-30 03:26:20,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-11-30 03:26:20,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-11-30 03:26:20,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2023-11-30 03:26:20,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-11-30 03:26:20,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-11-30 03:26:20,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-11-30 03:26:20,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-11-30 03:26:20,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-11-30 03:26:20,055 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:26:20,056 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:26:20,060 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:26:20,060 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:26:20,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:26:20 BasicIcfg [2023-11-30 03:26:20,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:26:20,065 INFO L158 Benchmark]: Toolchain (without parser) took 4342.16ms. Allocated memory is still 585.1MB. Free memory was 535.3MB in the beginning and 407.6MB in the end (delta: 127.7MB). Peak memory consumption was 128.3MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,066 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory was 326.5MB in the beginning and 326.3MB in the end (delta: 170.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.74ms. Allocated memory is still 585.1MB. Free memory was 535.0MB in the beginning and 523.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 585.1MB. Free memory was 523.0MB in the beginning and 520.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,066 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 585.1MB. Free memory was 520.3MB in the beginning and 518.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,066 INFO L158 Benchmark]: RCFGBuilder took 746.83ms. Allocated memory is still 585.1MB. Free memory was 518.2MB in the beginning and 508.3MB in the end (delta: 10.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,067 INFO L158 Benchmark]: TraceAbstraction took 3354.37ms. Allocated memory is still 585.1MB. Free memory was 507.2MB in the beginning and 407.6MB in the end (delta: 99.6MB). Peak memory consumption was 99.6MB. Max. memory is 16.0GB. [2023-11-30 03:26:20,068 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory was 326.5MB in the beginning and 326.3MB in the end (delta: 170.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 173.74ms. Allocated memory is still 585.1MB. Free memory was 535.0MB in the beginning and 523.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 585.1MB. Free memory was 523.0MB in the beginning and 520.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 585.1MB. Free memory was 520.3MB in the beginning and 518.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 746.83ms. Allocated memory is still 585.1MB. Free memory was 518.2MB in the beginning and 508.3MB in the end (delta: 10.0MB). Peak memory consumption was 26.6MB. Max. memory is 16.0GB. * TraceAbstraction took 3354.37ms. Allocated memory is still 585.1MB. Free memory was 507.2MB in the beginning and 407.6MB in the end (delta: 99.6MB). Peak memory consumption was 99.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 230 locations, 51 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 340 IncrementalHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 88 mSDtfsCounter, 340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1318occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 677 NumberOfCodeBlocks, 677 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:26:20,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...