/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-more-buffer-series2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:20:15,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:20:15,831 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:20:15,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:20:15,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:20:15,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:20:15,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:20:15,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:20:15,859 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:20:15,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:20:15,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:20:15,863 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:20:15,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:20:15,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:20:15,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:20:15,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:20:15,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:20:15,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:20:15,867 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:20:15,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:20:15,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:20:15,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:20:15,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:20:15,868 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:20:15,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:20:15,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:20:15,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:20:15,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:20:15,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:20:15,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:20:15,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:20:15,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:20:15,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:20:15,870 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:20:16,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:20:16,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:20:16,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:20:16,102 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:20:16,102 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:20:16,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2023-11-30 03:20:17,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:20:17,514 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:20:17,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2023-11-30 03:20:17,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff64a0d/38c9f5d049d545a6bc28fa3aaeff7e4a/FLAG38a3aed9c [2023-11-30 03:20:17,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aff64a0d/38c9f5d049d545a6bc28fa3aaeff7e4a [2023-11-30 03:20:17,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:20:17,546 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:20:17,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:20:17,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:20:17,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:20:17,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4a3d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17, skipping insertion in model container [2023-11-30 03:20:17,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:20:17,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:20:17,707 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:20:17,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:20:17,773 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:20:17,776 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:20:17,781 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:20:17,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17 WrapperNode [2023-11-30 03:20:17,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:20:17,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:20:17,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:20:17,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:20:17,788 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:20:17" (1/1) ... [2023-11-30 03:20:17,810 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:20:17" (1/1) ... [2023-11-30 03:20:17,839 INFO L138 Inliner]: procedures = 27, calls = 84, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 692 [2023-11-30 03:20:17,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:20:17,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:20:17,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:20:17,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:20:17,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:20:17,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:20:17,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:20:17,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:20:17,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (1/1) ... [2023-11-30 03:20:17,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:20:17,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:20:17,901 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:20:17,941 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:20:17,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:20:17,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:20:17,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:20:17,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:20:17,946 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:20:17,946 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:20:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:20:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:20:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:20:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:20:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:20:17,947 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:20:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:20:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:20:17,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:20:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:20:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:20:17,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:20:17,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:20:17,949 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:20:18,067 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:20:18,068 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:20:18,712 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:20:19,180 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:20:19,180 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-30 03:20:19,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:20:19 BoogieIcfgContainer [2023-11-30 03:20:19,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:20:19,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:20:19,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:20:19,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:20:19,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:20:17" (1/3) ... [2023-11-30 03:20:19,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10174bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:20:19, skipping insertion in model container [2023-11-30 03:20:19,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:17" (2/3) ... [2023-11-30 03:20:19,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10174bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:20:19, skipping insertion in model container [2023-11-30 03:20:19,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:20:19" (3/3) ... [2023-11-30 03:20:19,189 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2023-11-30 03:20:19,204 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:20:19,204 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2023-11-30 03:20:19,205 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:20:19,311 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:20:19,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 467 places, 476 transitions, 980 flow [2023-11-30 03:20:19,479 INFO L124 PetriNetUnfolderBase]: 22/472 cut-off events. [2023-11-30 03:20:19,480 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:20:19,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 472 events. 22/472 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 693 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 383. Up to 2 conditions per place. [2023-11-30 03:20:19,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 467 places, 476 transitions, 980 flow [2023-11-30 03:20:19,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 447 transitions, 918 flow [2023-11-30 03:20:19,511 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:20:19,517 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;@45a8ba8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:20:19,517 INFO L363 AbstractCegarLoop]: Starting to check reachability of 186 error locations. [2023-11-30 03:20:19,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:20:19,522 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2023-11-30 03:20:19,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:20:19,523 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:19,523 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:19,524 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:19,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -361342956, now seen corresponding path program 1 times [2023-11-30 03:20:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859857303] [2023-11-30 03:20:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:19,779 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:20:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:19,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859857303] [2023-11-30 03:20:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859857303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:19,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727270812] [2023-11-30 03:20:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:19,787 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:19,811 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 476 [2023-11-30 03:20:19,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 447 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:19,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:19,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 476 [2023-11-30 03:20:19,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:20,426 INFO L124 PetriNetUnfolderBase]: 451/1265 cut-off events. [2023-11-30 03:20:20,426 INFO L125 PetriNetUnfolderBase]: For 175/282 co-relation queries the response was YES. [2023-11-30 03:20:20,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 1265 events. 451/1265 cut-off events. For 175/282 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5502 event pairs, 272 based on Foata normal form. 186/1303 useless extension candidates. Maximal degree in co-relation 1562. Up to 618 conditions per place. [2023-11-30 03:20:20,452 INFO L140 encePairwiseOnDemand]: 380/476 looper letters, 29 selfloop transitions, 2 changer transitions 7/353 dead transitions. [2023-11-30 03:20:20,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 353 transitions, 792 flow [2023-11-30 03:20:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1169 transitions. [2023-11-30 03:20:20,465 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8186274509803921 [2023-11-30 03:20:20,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1169 transitions. [2023-11-30 03:20:20,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1169 transitions. [2023-11-30 03:20:20,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:20,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1169 transitions. [2023-11-30 03:20:20,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 389.6666666666667) internal successors, (1169), 3 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,482 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -78 predicate places. [2023-11-30 03:20:20,482 INFO L500 AbstractCegarLoop]: Abstraction has has 361 places, 353 transitions, 792 flow [2023-11-30 03:20:20,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,483 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:20,483 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] [2023-11-30 03:20:20,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:20:20,484 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:20,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash -41516963, now seen corresponding path program 1 times [2023-11-30 03:20:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221198272] [2023-11-30 03:20:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:20,536 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:20:20,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221198272] [2023-11-30 03:20:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221198272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:20,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718612041] [2023-11-30 03:20:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:20,538 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:20,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:20,539 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 476 [2023-11-30 03:20:20,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 353 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:20,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 476 [2023-11-30 03:20:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:20,760 INFO L124 PetriNetUnfolderBase]: 451/1264 cut-off events. [2023-11-30 03:20:20,761 INFO L125 PetriNetUnfolderBase]: For 455/3330 co-relation queries the response was YES. [2023-11-30 03:20:20,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 1264 events. 451/1264 cut-off events. For 455/3330 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5555 event pairs, 272 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 2129. Up to 618 conditions per place. [2023-11-30 03:20:20,769 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 26 selfloop transitions, 2 changer transitions 7/352 dead transitions. [2023-11-30 03:20:20,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 352 transitions, 846 flow [2023-11-30 03:20:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2023-11-30 03:20:20,771 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.757703081232493 [2023-11-30 03:20:20,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1082 transitions. [2023-11-30 03:20:20,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1082 transitions. [2023-11-30 03:20:20,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:20,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1082 transitions. [2023-11-30 03:20:20,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,777 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -77 predicate places. [2023-11-30 03:20:20,777 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 352 transitions, 846 flow [2023-11-30 03:20:20,778 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,778 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:20,778 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] [2023-11-30 03:20:20,778 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:20:20,779 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:20,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1669345835, now seen corresponding path program 1 times [2023-11-30 03:20:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936310258] [2023-11-30 03:20:20,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:20,851 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:20:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936310258] [2023-11-30 03:20:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936310258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:20,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558251309] [2023-11-30 03:20:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:20,852 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:20,855 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 476 [2023-11-30 03:20:20,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 352 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:20,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:20,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 476 [2023-11-30 03:20:20,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:21,138 INFO L124 PetriNetUnfolderBase]: 451/1263 cut-off events. [2023-11-30 03:20:21,138 INFO L125 PetriNetUnfolderBase]: For 920/6563 co-relation queries the response was YES. [2023-11-30 03:20:21,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 1263 events. 451/1263 cut-off events. For 920/6563 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5519 event pairs, 272 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 2696. Up to 618 conditions per place. [2023-11-30 03:20:21,146 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 26 selfloop transitions, 2 changer transitions 7/351 dead transitions. [2023-11-30 03:20:21,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 351 transitions, 900 flow [2023-11-30 03:20:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2023-11-30 03:20:21,148 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.757703081232493 [2023-11-30 03:20:21,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1082 transitions. [2023-11-30 03:20:21,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1082 transitions. [2023-11-30 03:20:21,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:21,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1082 transitions. [2023-11-30 03:20:21,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,154 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -76 predicate places. [2023-11-30 03:20:21,154 INFO L500 AbstractCegarLoop]: Abstraction has has 363 places, 351 transitions, 900 flow [2023-11-30 03:20:21,155 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,155 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:21,155 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] [2023-11-30 03:20:21,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:20:21,155 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:21,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -322177251, now seen corresponding path program 1 times [2023-11-30 03:20:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438695549] [2023-11-30 03:20:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:21,208 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:20:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438695549] [2023-11-30 03:20:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438695549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054590403] [2023-11-30 03:20:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:21,209 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:21,210 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 476 [2023-11-30 03:20:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 351 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 476 [2023-11-30 03:20:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:21,525 INFO L124 PetriNetUnfolderBase]: 451/1262 cut-off events. [2023-11-30 03:20:21,525 INFO L125 PetriNetUnfolderBase]: For 1570/9981 co-relation queries the response was YES. [2023-11-30 03:20:21,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 1262 events. 451/1262 cut-off events. For 1570/9981 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5560 event pairs, 272 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 3263. Up to 618 conditions per place. [2023-11-30 03:20:21,540 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 26 selfloop transitions, 2 changer transitions 7/350 dead transitions. [2023-11-30 03:20:21,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 350 transitions, 954 flow [2023-11-30 03:20:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2023-11-30 03:20:21,543 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.757703081232493 [2023-11-30 03:20:21,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1082 transitions. [2023-11-30 03:20:21,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1082 transitions. [2023-11-30 03:20:21,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:21,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1082 transitions. [2023-11-30 03:20:21,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,550 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -75 predicate places. [2023-11-30 03:20:21,550 INFO L500 AbstractCegarLoop]: Abstraction has has 364 places, 350 transitions, 954 flow [2023-11-30 03:20:21,551 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,551 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:21,551 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:21,552 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:20:21,552 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:21,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash 764868423, now seen corresponding path program 1 times [2023-11-30 03:20:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:21,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008485542] [2023-11-30 03:20:21,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:21,593 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:20:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008485542] [2023-11-30 03:20:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008485542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:21,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:21,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527253334] [2023-11-30 03:20:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:21,595 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:21,597 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 476 [2023-11-30 03:20:21,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 350 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:21,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:21,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 476 [2023-11-30 03:20:21,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:21,988 INFO L124 PetriNetUnfolderBase]: 595/1830 cut-off events. [2023-11-30 03:20:21,988 INFO L125 PetriNetUnfolderBase]: For 3343/11021 co-relation queries the response was YES. [2023-11-30 03:20:21,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6052 conditions, 1830 events. 595/1830 cut-off events. For 3343/11021 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10274 event pairs, 228 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 5352. Up to 814 conditions per place. [2023-11-30 03:20:22,004 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 37 selfloop transitions, 2 changer transitions 7/364 dead transitions. [2023-11-30 03:20:22,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 364 transitions, 1193 flow [2023-11-30 03:20:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2023-11-30 03:20:22,007 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7738095238095238 [2023-11-30 03:20:22,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1105 transitions. [2023-11-30 03:20:22,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1105 transitions. [2023-11-30 03:20:22,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:22,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1105 transitions. [2023-11-30 03:20:22,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,015 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -74 predicate places. [2023-11-30 03:20:22,015 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 364 transitions, 1193 flow [2023-11-30 03:20:22,016 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,016 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:22,016 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] [2023-11-30 03:20:22,016 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:20:22,016 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:22,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:22,018 INFO L85 PathProgramCache]: Analyzing trace with hash 324171339, now seen corresponding path program 1 times [2023-11-30 03:20:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612821268] [2023-11-30 03:20:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:22,076 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:20:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612821268] [2023-11-30 03:20:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612821268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:22,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651600042] [2023-11-30 03:20:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:22,078 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:22,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:22,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:22,080 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 476 [2023-11-30 03:20:22,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 364 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:22,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 476 [2023-11-30 03:20:22,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:22,402 INFO L124 PetriNetUnfolderBase]: 595/1829 cut-off events. [2023-11-30 03:20:22,402 INFO L125 PetriNetUnfolderBase]: For 4764/14340 co-relation queries the response was YES. [2023-11-30 03:20:22,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 1829 events. 595/1829 cut-off events. For 4764/14340 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10327 event pairs, 228 based on Foata normal form. 0/1605 useless extension candidates. Maximal degree in co-relation 6108. Up to 814 conditions per place. [2023-11-30 03:20:22,419 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 38 selfloop transitions, 2 changer transitions 7/363 dead transitions. [2023-11-30 03:20:22,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 363 transitions, 1271 flow [2023-11-30 03:20:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-30 03:20:22,422 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-30 03:20:22,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-30 03:20:22,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-30 03:20:22,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:22,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-30 03:20:22,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,428 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -73 predicate places. [2023-11-30 03:20:22,428 INFO L500 AbstractCegarLoop]: Abstraction has has 366 places, 363 transitions, 1271 flow [2023-11-30 03:20:22,428 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,428 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:22,429 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] [2023-11-30 03:20:22,429 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:20:22,429 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:22,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash 617110432, now seen corresponding path program 1 times [2023-11-30 03:20:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76485599] [2023-11-30 03:20:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:22,454 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:20:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:22,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76485599] [2023-11-30 03:20:22,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76485599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:22,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:22,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112906470] [2023-11-30 03:20:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:22,455 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:22,457 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 476 [2023-11-30 03:20:22,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 363 transitions, 1271 flow. Second operand has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:22,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 476 [2023-11-30 03:20:22,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:22,749 INFO L124 PetriNetUnfolderBase]: 595/1682 cut-off events. [2023-11-30 03:20:22,749 INFO L125 PetriNetUnfolderBase]: For 6138/29273 co-relation queries the response was YES. [2023-11-30 03:20:22,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7527 conditions, 1682 events. 595/1682 cut-off events. For 6138/29273 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8638 event pairs, 174 based on Foata normal form. 0/1490 useless extension candidates. Maximal degree in co-relation 6706. Up to 814 conditions per place. [2023-11-30 03:20:22,764 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 41 selfloop transitions, 2 changer transitions 7/362 dead transitions. [2023-11-30 03:20:22,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 362 transitions, 1355 flow [2023-11-30 03:20:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2023-11-30 03:20:22,766 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.757703081232493 [2023-11-30 03:20:22,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1082 transitions. [2023-11-30 03:20:22,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1082 transitions. [2023-11-30 03:20:22,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:22,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1082 transitions. [2023-11-30 03:20:22,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,770 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -72 predicate places. [2023-11-30 03:20:22,770 INFO L500 AbstractCegarLoop]: Abstraction has has 367 places, 362 transitions, 1355 flow [2023-11-30 03:20:22,772 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 352.3333333333333) internal successors, (1057), 3 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,772 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:22,772 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] [2023-11-30 03:20:22,772 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:20:22,772 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:22,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1875235280, now seen corresponding path program 1 times [2023-11-30 03:20:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087850237] [2023-11-30 03:20:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:22,813 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:20:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:22,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087850237] [2023-11-30 03:20:22,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087850237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:22,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833670655] [2023-11-30 03:20:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:22,815 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:22,816 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 476 [2023-11-30 03:20:22,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 362 transitions, 1355 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:22,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:22,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 476 [2023-11-30 03:20:22,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:23,144 INFO L124 PetriNetUnfolderBase]: 749/1933 cut-off events. [2023-11-30 03:20:23,144 INFO L125 PetriNetUnfolderBase]: For 9386/47079 co-relation queries the response was YES. [2023-11-30 03:20:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10286 conditions, 1933 events. 749/1933 cut-off events. For 9386/47079 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10321 event pairs, 121 based on Foata normal form. 5/1728 useless extension candidates. Maximal degree in co-relation 9358. Up to 1024 conditions per place. [2023-11-30 03:20:23,172 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 62 selfloop transitions, 3 changer transitions 7/387 dead transitions. [2023-11-30 03:20:23,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 387 transitions, 1921 flow [2023-11-30 03:20:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1104 transitions. [2023-11-30 03:20:23,175 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.773109243697479 [2023-11-30 03:20:23,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1104 transitions. [2023-11-30 03:20:23,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1104 transitions. [2023-11-30 03:20:23,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:23,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1104 transitions. [2023-11-30 03:20:23,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,183 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -71 predicate places. [2023-11-30 03:20:23,183 INFO L500 AbstractCegarLoop]: Abstraction has has 368 places, 387 transitions, 1921 flow [2023-11-30 03:20:23,184 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,184 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:23,184 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] [2023-11-30 03:20:23,184 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:20:23,184 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:23,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1911406734, now seen corresponding path program 1 times [2023-11-30 03:20:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213288806] [2023-11-30 03:20:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:23,218 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:20:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:23,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213288806] [2023-11-30 03:20:23,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213288806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:23,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:23,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:23,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909280064] [2023-11-30 03:20:23,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:23,220 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:23,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:23,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:23,221 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 476 [2023-11-30 03:20:23,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 387 transitions, 1921 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:23,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 476 [2023-11-30 03:20:23,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:23,777 INFO L124 PetriNetUnfolderBase]: 749/2174 cut-off events. [2023-11-30 03:20:23,777 INFO L125 PetriNetUnfolderBase]: For 12818/33197 co-relation queries the response was YES. [2023-11-30 03:20:23,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11547 conditions, 2174 events. 749/2174 cut-off events. For 12818/33197 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12981 event pairs, 159 based on Foata normal form. 0/1915 useless extension candidates. Maximal degree in co-relation 10556. Up to 1024 conditions per place. [2023-11-30 03:20:23,815 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 64 selfloop transitions, 2 changer transitions 7/386 dead transitions. [2023-11-30 03:20:23,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 386 transitions, 2051 flow [2023-11-30 03:20:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-30 03:20:23,825 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-30 03:20:23,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-30 03:20:23,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-30 03:20:23,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:23,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-30 03:20:23,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,844 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -70 predicate places. [2023-11-30 03:20:23,844 INFO L500 AbstractCegarLoop]: Abstraction has has 369 places, 386 transitions, 2051 flow [2023-11-30 03:20:23,844 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,845 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:23,845 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] [2023-11-30 03:20:23,845 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:20:23,845 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:23,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 43780869, now seen corresponding path program 1 times [2023-11-30 03:20:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059868496] [2023-11-30 03:20:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:23,883 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:20:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059868496] [2023-11-30 03:20:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059868496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:23,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:23,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427273305] [2023-11-30 03:20:23,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:23,886 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:23,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:23,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:23,888 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 476 [2023-11-30 03:20:23,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 386 transitions, 2051 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:23,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:23,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 476 [2023-11-30 03:20:23,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:24,324 INFO L124 PetriNetUnfolderBase]: 749/2221 cut-off events. [2023-11-30 03:20:24,325 INFO L125 PetriNetUnfolderBase]: For 15897/41008 co-relation queries the response was YES. [2023-11-30 03:20:24,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12612 conditions, 2221 events. 749/2221 cut-off events. For 15897/41008 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13333 event pairs, 165 based on Foata normal form. 0/1957 useless extension candidates. Maximal degree in co-relation 11564. Up to 1024 conditions per place. [2023-11-30 03:20:24,356 INFO L140 encePairwiseOnDemand]: 474/476 looper letters, 64 selfloop transitions, 1 changer transitions 7/385 dead transitions. [2023-11-30 03:20:24,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 385 transitions, 2177 flow [2023-11-30 03:20:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:24,358 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7633053221288515 [2023-11-30 03:20:24,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:24,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:24,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:24,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:24,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,362 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -69 predicate places. [2023-11-30 03:20:24,362 INFO L500 AbstractCegarLoop]: Abstraction has has 370 places, 385 transitions, 2177 flow [2023-11-30 03:20:24,363 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,363 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:24,363 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] [2023-11-30 03:20:24,363 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:20:24,363 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:24,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1652046895, now seen corresponding path program 1 times [2023-11-30 03:20:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239508225] [2023-11-30 03:20:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:24,390 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:20:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239508225] [2023-11-30 03:20:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239508225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011813212] [2023-11-30 03:20:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:24,391 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:24,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:24,392 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 476 [2023-11-30 03:20:24,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 385 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:24,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 476 [2023-11-30 03:20:24,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:24,813 INFO L124 PetriNetUnfolderBase]: 749/2172 cut-off events. [2023-11-30 03:20:24,814 INFO L125 PetriNetUnfolderBase]: For 19418/49597 co-relation queries the response was YES. [2023-11-30 03:20:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13583 conditions, 2172 events. 749/2172 cut-off events. For 19418/49597 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12915 event pairs, 159 based on Foata normal form. 0/1915 useless extension candidates. Maximal degree in co-relation 12476. Up to 1024 conditions per place. [2023-11-30 03:20:24,841 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 64 selfloop transitions, 2 changer transitions 7/384 dead transitions. [2023-11-30 03:20:24,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 384 transitions, 2307 flow [2023-11-30 03:20:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-30 03:20:24,843 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-30 03:20:24,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-30 03:20:24,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-30 03:20:24,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:24,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-30 03:20:24,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,847 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -68 predicate places. [2023-11-30 03:20:24,847 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 384 transitions, 2307 flow [2023-11-30 03:20:24,848 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:24,848 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:24,848 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] [2023-11-30 03:20:24,848 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:20:24,848 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:24,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1765821374, now seen corresponding path program 1 times [2023-11-30 03:20:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374670124] [2023-11-30 03:20:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:25,131 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:20:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374670124] [2023-11-30 03:20:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374670124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219045224] [2023-11-30 03:20:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:25,131 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:25,133 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 476 [2023-11-30 03:20:25,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 384 transitions, 2307 flow. Second operand has 6 states, 6 states have (on average 281.8333333333333) internal successors, (1691), 6 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:25,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:25,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 476 [2023-11-30 03:20:25,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:27,111 INFO L124 PetriNetUnfolderBase]: 5309/8589 cut-off events. [2023-11-30 03:20:27,111 INFO L125 PetriNetUnfolderBase]: For 246918/249184 co-relation queries the response was YES. [2023-11-30 03:20:27,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77085 conditions, 8589 events. 5309/8589 cut-off events. For 246918/249184 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48941 event pairs, 1735 based on Foata normal form. 0/7971 useless extension candidates. Maximal degree in co-relation 75172. Up to 6910 conditions per place. [2023-11-30 03:20:27,272 INFO L140 encePairwiseOnDemand]: 458/476 looper letters, 124 selfloop transitions, 15 changer transitions 7/381 dead transitions. [2023-11-30 03:20:27,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 381 transitions, 2579 flow [2023-11-30 03:20:27,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1781 transitions. [2023-11-30 03:20:27,276 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6235994397759104 [2023-11-30 03:20:27,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1781 transitions. [2023-11-30 03:20:27,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1781 transitions. [2023-11-30 03:20:27,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:27,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1781 transitions. [2023-11-30 03:20:27,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.8333333333333) internal successors, (1781), 6 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:27,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:27,282 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:27,283 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -66 predicate places. [2023-11-30 03:20:27,283 INFO L500 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 2579 flow [2023-11-30 03:20:27,283 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.8333333333333) internal successors, (1691), 6 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:27,283 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:27,283 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:27,283 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:20:27,283 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:27,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1161508258, now seen corresponding path program 1 times [2023-11-30 03:20:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596747130] [2023-11-30 03:20:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:27,319 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:20:27,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:27,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596747130] [2023-11-30 03:20:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596747130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:27,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919996780] [2023-11-30 03:20:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:27,323 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:27,325 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 476 [2023-11-30 03:20:27,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 381 transitions, 2579 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:27,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:27,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 476 [2023-11-30 03:20:27,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:29,213 INFO L124 PetriNetUnfolderBase]: 5309/8712 cut-off events. [2023-11-30 03:20:29,214 INFO L125 PetriNetUnfolderBase]: For 302101/304767 co-relation queries the response was YES. [2023-11-30 03:20:29,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82786 conditions, 8712 events. 5309/8712 cut-off events. For 302101/304767 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 50772 event pairs, 1776 based on Foata normal form. 0/8060 useless extension candidates. Maximal degree in co-relation 80768. Up to 6910 conditions per place. [2023-11-30 03:20:29,358 INFO L140 encePairwiseOnDemand]: 474/476 looper letters, 64 selfloop transitions, 1 changer transitions 7/380 dead transitions. [2023-11-30 03:20:29,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 380 transitions, 2705 flow [2023-11-30 03:20:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:29,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7633053221288515 [2023-11-30 03:20:29,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:29,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:29,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:29,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:29,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:29,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:29,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:29,375 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -65 predicate places. [2023-11-30 03:20:29,375 INFO L500 AbstractCegarLoop]: Abstraction has has 374 places, 380 transitions, 2705 flow [2023-11-30 03:20:29,375 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:29,376 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:29,376 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:29,376 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:20:29,376 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:29,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1974261894, now seen corresponding path program 1 times [2023-11-30 03:20:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793790482] [2023-11-30 03:20:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:29,411 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:20:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793790482] [2023-11-30 03:20:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793790482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:29,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660904479] [2023-11-30 03:20:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:29,412 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:29,413 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 476 [2023-11-30 03:20:29,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 380 transitions, 2705 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 476 [2023-11-30 03:20:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:31,163 INFO L124 PetriNetUnfolderBase]: 5309/8587 cut-off events. [2023-11-30 03:20:31,164 INFO L125 PetriNetUnfolderBase]: For 340274/343052 co-relation queries the response was YES. [2023-11-30 03:20:31,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88241 conditions, 8587 events. 5309/8587 cut-off events. For 340274/343052 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48849 event pairs, 1735 based on Foata normal form. 0/7971 useless extension candidates. Maximal degree in co-relation 86116. Up to 6910 conditions per place. [2023-11-30 03:20:31,289 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 64 selfloop transitions, 2 changer transitions 7/379 dead transitions. [2023-11-30 03:20:31,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 2835 flow [2023-11-30 03:20:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-30 03:20:31,291 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-30 03:20:31,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-30 03:20:31,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-30 03:20:31,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:31,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-30 03:20:31,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:31,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:31,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:31,295 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -64 predicate places. [2023-11-30 03:20:31,295 INFO L500 AbstractCegarLoop]: Abstraction has has 375 places, 379 transitions, 2835 flow [2023-11-30 03:20:31,295 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:31,295 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:31,295 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:31,295 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:20:31,296 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:31,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1355634316, now seen corresponding path program 1 times [2023-11-30 03:20:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930765078] [2023-11-30 03:20:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:31,324 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:20:31,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930765078] [2023-11-30 03:20:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930765078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:31,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:31,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:31,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601095468] [2023-11-30 03:20:31,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:31,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:31,326 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 476 [2023-11-30 03:20:31,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 379 transitions, 2835 flow. Second operand has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:31,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:31,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 476 [2023-11-30 03:20:31,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:33,289 INFO L124 PetriNetUnfolderBase]: 5309/8585 cut-off events. [2023-11-30 03:20:33,289 INFO L125 PetriNetUnfolderBase]: For 392546/395580 co-relation queries the response was YES. [2023-11-30 03:20:33,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93818 conditions, 8585 events. 5309/8585 cut-off events. For 392546/395580 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48913 event pairs, 1735 based on Foata normal form. 0/7971 useless extension candidates. Maximal degree in co-relation 91588. Up to 6910 conditions per place. [2023-11-30 03:20:33,413 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 66 selfloop transitions, 1 changer transitions 7/377 dead transitions. [2023-11-30 03:20:33,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 377 transitions, 2961 flow [2023-11-30 03:20:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2023-11-30 03:20:33,415 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7591036414565826 [2023-11-30 03:20:33,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1084 transitions. [2023-11-30 03:20:33,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1084 transitions. [2023-11-30 03:20:33,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:33,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1084 transitions. [2023-11-30 03:20:33,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:33,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:33,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:33,419 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -64 predicate places. [2023-11-30 03:20:33,419 INFO L500 AbstractCegarLoop]: Abstraction has has 375 places, 377 transitions, 2961 flow [2023-11-30 03:20:33,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:33,419 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:33,419 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:33,419 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:20:33,420 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:33,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash -450698239, now seen corresponding path program 1 times [2023-11-30 03:20:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632540918] [2023-11-30 03:20:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:33,453 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:20:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632540918] [2023-11-30 03:20:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632540918] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035884554] [2023-11-30 03:20:33,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:33,454 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:33,455 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 476 [2023-11-30 03:20:33,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 2961 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:33,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:33,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 476 [2023-11-30 03:20:33,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:35,407 INFO L124 PetriNetUnfolderBase]: 5309/8708 cut-off events. [2023-11-30 03:20:35,407 INFO L125 PetriNetUnfolderBase]: For 464516/467986 co-relation queries the response was YES. [2023-11-30 03:20:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99521 conditions, 8708 events. 5309/8708 cut-off events. For 464516/467986 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 50781 event pairs, 1776 based on Foata normal form. 0/8060 useless extension candidates. Maximal degree in co-relation 97184. Up to 6910 conditions per place. [2023-11-30 03:20:35,577 INFO L140 encePairwiseOnDemand]: 473/476 looper letters, 64 selfloop transitions, 2 changer transitions 7/376 dead transitions. [2023-11-30 03:20:35,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 376 transitions, 3091 flow [2023-11-30 03:20:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-30 03:20:35,579 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2023-11-30 03:20:35,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-30 03:20:35,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-30 03:20:35,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:35,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-30 03:20:35,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:35,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:35,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:35,584 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -63 predicate places. [2023-11-30 03:20:35,584 INFO L500 AbstractCegarLoop]: Abstraction has has 376 places, 376 transitions, 3091 flow [2023-11-30 03:20:35,584 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:35,584 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:35,584 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:35,585 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:20:35,585 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:35,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1334187948, now seen corresponding path program 1 times [2023-11-30 03:20:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025632647] [2023-11-30 03:20:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:36,286 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:20:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:36,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025632647] [2023-11-30 03:20:36,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025632647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:36,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:36,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092247505] [2023-11-30 03:20:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:36,288 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:36,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:36,289 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 476 [2023-11-30 03:20:36,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 376 transitions, 3091 flow. Second operand has 6 states, 6 states have (on average 314.1666666666667) internal successors, (1885), 6 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:36,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:36,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 476 [2023-11-30 03:20:36,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:38,566 INFO L124 PetriNetUnfolderBase]: 5309/8116 cut-off events. [2023-11-30 03:20:38,566 INFO L125 PetriNetUnfolderBase]: For 531121/534859 co-relation queries the response was YES. [2023-11-30 03:20:38,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105674 conditions, 8116 events. 5309/8116 cut-off events. For 531121/534859 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 41830 event pairs, 306 based on Foata normal form. 0/7811 useless extension candidates. Maximal degree in co-relation 103176. Up to 6766 conditions per place. [2023-11-30 03:20:38,693 INFO L140 encePairwiseOnDemand]: 471/476 looper letters, 259 selfloop transitions, 4 changer transitions 7/535 dead transitions. [2023-11-30 03:20:38,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 535 transitions, 9053 flow [2023-11-30 03:20:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1983 transitions. [2023-11-30 03:20:38,699 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.694327731092437 [2023-11-30 03:20:38,699 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1983 transitions. [2023-11-30 03:20:38,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1983 transitions. [2023-11-30 03:20:38,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:38,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1983 transitions. [2023-11-30 03:20:38,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.5) internal successors, (1983), 6 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:38,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:38,705 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:38,705 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -59 predicate places. [2023-11-30 03:20:38,705 INFO L500 AbstractCegarLoop]: Abstraction has has 380 places, 535 transitions, 9053 flow [2023-11-30 03:20:38,706 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.1666666666667) internal successors, (1885), 6 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:38,706 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:38,706 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:38,706 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:20:38,706 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:38,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 687795015, now seen corresponding path program 1 times [2023-11-30 03:20:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259701309] [2023-11-30 03:20:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:39,300 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:20:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259701309] [2023-11-30 03:20:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259701309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:39,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265134652] [2023-11-30 03:20:39,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:39,301 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:39,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:39,303 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 476 [2023-11-30 03:20:39,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 535 transitions, 9053 flow. Second operand has 6 states, 6 states have (on average 315.3333333333333) internal successors, (1892), 6 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:39,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:39,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 476 [2023-11-30 03:20:39,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:41,668 INFO L124 PetriNetUnfolderBase]: 5312/8114 cut-off events. [2023-11-30 03:20:41,669 INFO L125 PetriNetUnfolderBase]: For 545602/549970 co-relation queries the response was YES. [2023-11-30 03:20:41,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112377 conditions, 8114 events. 5312/8114 cut-off events. For 545602/549970 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 41600 event pairs, 308 based on Foata normal form. 0/7834 useless extension candidates. Maximal degree in co-relation 84184. Up to 6721 conditions per place. [2023-11-30 03:20:41,807 INFO L140 encePairwiseOnDemand]: 471/476 looper letters, 370 selfloop transitions, 4 changer transitions 7/646 dead transitions. [2023-11-30 03:20:41,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 646 transitions, 13827 flow [2023-11-30 03:20:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1970 transitions. [2023-11-30 03:20:41,810 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6897759103641457 [2023-11-30 03:20:41,810 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1970 transitions. [2023-11-30 03:20:41,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1970 transitions. [2023-11-30 03:20:41,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:41,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1970 transitions. [2023-11-30 03:20:41,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 328.3333333333333) internal successors, (1970), 6 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:41,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:41,816 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:41,816 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -55 predicate places. [2023-11-30 03:20:41,816 INFO L500 AbstractCegarLoop]: Abstraction has has 384 places, 646 transitions, 13827 flow [2023-11-30 03:20:41,817 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 315.3333333333333) internal successors, (1892), 6 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:41,817 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:41,817 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:41,817 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:20:41,817 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:41,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1865478422, now seen corresponding path program 1 times [2023-11-30 03:20:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:41,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782026747] [2023-11-30 03:20:41,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:42,309 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:20:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:42,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782026747] [2023-11-30 03:20:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782026747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567444896] [2023-11-30 03:20:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:42,310 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:42,311 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 476 [2023-11-30 03:20:42,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 646 transitions, 13827 flow. Second operand has 6 states, 6 states have (on average 316.5) internal successors, (1899), 6 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:42,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:42,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 476 [2023-11-30 03:20:42,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:44,770 INFO L124 PetriNetUnfolderBase]: 5330/8191 cut-off events. [2023-11-30 03:20:44,771 INFO L125 PetriNetUnfolderBase]: For 565870/569866 co-relation queries the response was YES. [2023-11-30 03:20:44,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119456 conditions, 8191 events. 5330/8191 cut-off events. For 565870/569866 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 42537 event pairs, 320 based on Foata normal form. 0/7906 useless extension candidates. Maximal degree in co-relation 89560. Up to 6723 conditions per place. [2023-11-30 03:20:45,024 INFO L140 encePairwiseOnDemand]: 471/476 looper letters, 433 selfloop transitions, 4 changer transitions 7/709 dead transitions. [2023-11-30 03:20:45,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 709 transitions, 17125 flow [2023-11-30 03:20:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1957 transitions. [2023-11-30 03:20:45,027 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6852240896358543 [2023-11-30 03:20:45,027 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1957 transitions. [2023-11-30 03:20:45,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1957 transitions. [2023-11-30 03:20:45,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:45,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1957 transitions. [2023-11-30 03:20:45,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 326.1666666666667) internal successors, (1957), 6 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:45,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:45,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:45,034 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -51 predicate places. [2023-11-30 03:20:45,034 INFO L500 AbstractCegarLoop]: Abstraction has has 388 places, 709 transitions, 17125 flow [2023-11-30 03:20:45,034 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.5) internal successors, (1899), 6 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:45,034 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:45,034 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:45,034 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:20:45,034 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:45,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1670368016, now seen corresponding path program 1 times [2023-11-30 03:20:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31018883] [2023-11-30 03:20:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:45,691 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:20:45,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31018883] [2023-11-30 03:20:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31018883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:45,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:45,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969447883] [2023-11-30 03:20:45,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:45,691 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:45,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:45,693 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 476 [2023-11-30 03:20:45,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 709 transitions, 17125 flow. Second operand has 6 states, 6 states have (on average 317.6666666666667) internal successors, (1906), 6 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:45,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:45,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 476 [2023-11-30 03:20:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:47,938 INFO L124 PetriNetUnfolderBase]: 5438/8246 cut-off events. [2023-11-30 03:20:47,938 INFO L125 PetriNetUnfolderBase]: For 566394/566394 co-relation queries the response was YES. [2023-11-30 03:20:47,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128376 conditions, 8246 events. 5438/8246 cut-off events. For 566394/566394 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 41922 event pairs, 353 based on Foata normal form. 0/8014 useless extension candidates. Maximal degree in co-relation 96769. Up to 6823 conditions per place. [2023-11-30 03:20:48,098 INFO L140 encePairwiseOnDemand]: 471/476 looper letters, 464 selfloop transitions, 4 changer transitions 7/740 dead transitions. [2023-11-30 03:20:48,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 740 transitions, 19331 flow [2023-11-30 03:20:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1944 transitions. [2023-11-30 03:20:48,102 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.680672268907563 [2023-11-30 03:20:48,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1944 transitions. [2023-11-30 03:20:48,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1944 transitions. [2023-11-30 03:20:48,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:48,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1944 transitions. [2023-11-30 03:20:48,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:48,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:48,288 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:48,289 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -47 predicate places. [2023-11-30 03:20:48,289 INFO L500 AbstractCegarLoop]: Abstraction has has 392 places, 740 transitions, 19331 flow [2023-11-30 03:20:48,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 317.6666666666667) internal successors, (1906), 6 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:48,289 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:48,289 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:48,289 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:20:48,289 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 182 more)] === [2023-11-30 03:20:48,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -750445987, now seen corresponding path program 1 times [2023-11-30 03:20:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532948632] [2023-11-30 03:20:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:48,388 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:20:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532948632] [2023-11-30 03:20:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532948632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968437507] [2023-11-30 03:20:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:48,389 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:48,390 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 476 [2023-11-30 03:20:48,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 740 transitions, 19331 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:48,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:48,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 476 [2023-11-30 03:20:48,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:50,688 INFO L124 PetriNetUnfolderBase]: 5438/8242 cut-off events. [2023-11-30 03:20:50,688 INFO L125 PetriNetUnfolderBase]: For 638946/638946 co-relation queries the response was YES. [2023-11-30 03:20:50,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134080 conditions, 8242 events. 5438/8242 cut-off events. For 638946/638946 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 41866 event pairs, 353 based on Foata normal form. 4/8014 useless extension candidates. Maximal degree in co-relation 101107. Up to 6823 conditions per place. [2023-11-30 03:20:50,751 INFO L140 encePairwiseOnDemand]: 474/476 looper letters, 0 selfloop transitions, 0 changer transitions 739/739 dead transitions. [2023-11-30 03:20:50,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 739 transitions, 20189 flow [2023-11-30 03:20:50,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2023-11-30 03:20:50,753 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7675070028011205 [2023-11-30 03:20:50,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1096 transitions. [2023-11-30 03:20:50,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1096 transitions. [2023-11-30 03:20:50,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:50,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1096 transitions. [2023-11-30 03:20:50,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:50,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:50,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:50,757 INFO L307 CegarLoopForPetriNet]: 439 programPoint places, -46 predicate places. [2023-11-30 03:20:50,757 INFO L500 AbstractCegarLoop]: Abstraction has has 393 places, 739 transitions, 20189 flow [2023-11-30 03:20:50,758 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:50,770 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-buffer-series2.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:20:50,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (185 of 186 remaining) [2023-11-30 03:20:50,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (184 of 186 remaining) [2023-11-30 03:20:50,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (183 of 186 remaining) [2023-11-30 03:20:50,855 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (182 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (181 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (180 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (178 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (177 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (176 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (175 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (174 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (173 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (172 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (171 of 186 remaining) [2023-11-30 03:20:50,856 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (170 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (169 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (168 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (167 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (166 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (165 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (164 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (163 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (161 of 186 remaining) [2023-11-30 03:20:50,857 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (160 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (159 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (158 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (157 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (156 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (155 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (154 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (153 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (152 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (151 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (150 of 186 remaining) [2023-11-30 03:20:50,858 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (149 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (148 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (147 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (146 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (145 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (143 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (142 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (139 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (138 of 186 remaining) [2023-11-30 03:20:50,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (137 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (136 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (135 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (134 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (133 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (130 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (129 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (128 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (127 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (126 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (125 of 186 remaining) [2023-11-30 03:20:50,860 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (124 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (123 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (122 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (121 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (120 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (119 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (118 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (117 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (116 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (115 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (114 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (113 of 186 remaining) [2023-11-30 03:20:50,861 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (112 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (111 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (110 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (109 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (108 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (107 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (106 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (105 of 186 remaining) [2023-11-30 03:20:50,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (104 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (103 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 186 remaining) [2023-11-30 03:20:50,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 186 remaining) [2023-11-30 03:20:50,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 186 remaining) [2023-11-30 03:20:50,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 186 remaining) [2023-11-30 03:20:50,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 186 remaining) [2023-11-30 03:20:50,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 186 remaining) [2023-11-30 03:20:50,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 186 remaining) [2023-11-30 03:20:50,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 186 remaining) [2023-11-30 03:20:50,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 186 remaining) [2023-11-30 03:20:50,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 186 remaining) [2023-11-30 03:20:50,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 186 remaining) [2023-11-30 03:20:50,873 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 03:20:50,873 INFO L457 BasicCegarLoop]: Path program histogram: [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:20:50,880 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:20:50,880 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:20:50,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:20:50 BasicIcfg [2023-11-30 03:20:50,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:20:50,887 INFO L158 Benchmark]: Toolchain (without parser) took 33341.15ms. Allocated memory was 593.5MB in the beginning and 11.8GB in the end (delta: 11.2GB). Free memory was 540.8MB in the beginning and 9.4GB in the end (delta: -8.9GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-11-30 03:20:50,887 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 343.9MB. Free memory is still 294.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:20:50,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.64ms. Allocated memory is still 593.5MB. Free memory was 540.8MB in the beginning and 526.0MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 03:20:50,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.94ms. Allocated memory is still 593.5MB. Free memory was 526.0MB in the beginning and 521.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:20:50,887 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 593.5MB. Free memory was 521.1MB in the beginning and 516.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:20:50,887 INFO L158 Benchmark]: RCFGBuilder took 1304.85ms. Allocated memory is still 593.5MB. Free memory was 516.9MB in the beginning and 358.4MB in the end (delta: 158.5MB). Peak memory consumption was 160.6MB. Max. memory is 16.0GB. [2023-11-30 03:20:50,888 INFO L158 Benchmark]: TraceAbstraction took 31702.57ms. Allocated memory was 593.5MB in the beginning and 11.8GB in the end (delta: 11.2GB). Free memory was 357.4MB in the beginning and 9.4GB in the end (delta: -9.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-11-30 03:20:50,889 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.10ms. Allocated memory is still 343.9MB. Free memory is still 294.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 233.64ms. Allocated memory is still 593.5MB. Free memory was 540.8MB in the beginning and 526.0MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.94ms. Allocated memory is still 593.5MB. Free memory was 526.0MB in the beginning and 521.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 593.5MB. Free memory was 521.1MB in the beginning and 516.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1304.85ms. Allocated memory is still 593.5MB. Free memory was 516.9MB in the beginning and 358.4MB in the end (delta: 158.5MB). Peak memory consumption was 160.6MB. Max. memory is 16.0GB. * TraceAbstraction took 31702.57ms. Allocated memory was 593.5MB in the beginning and 11.8GB in the end (delta: 11.2GB). Free memory was 357.4MB in the beginning and 9.4GB in the end (delta: -9.1GB). Peak memory consumption was 2.2GB. 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: 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: 73]: 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: 74]: 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: 75]: 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: 75]: 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: 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: 77]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: 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 9 procedures, 570 locations, 186 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: 31.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 265 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 251 mSDtfsCounter, 1369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20189occurred in iteration=21, InterpolantAutomatonStates: 78, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2628 NumberOfCodeBlocks, 2628 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2607 ConstructedInterpolants, 0 QuantifiedInterpolants, 3078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 103 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:20:50,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...