/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-series.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:20:00,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:20:00,920 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:00,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:20:00,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:20:00,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:20:00,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:20:00,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:20:00,951 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:20:00,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:20:00,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:20:00,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:20:00,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:20:00,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:20:00,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:20:00,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:20:00,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:20:00,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:20:00,956 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:20:00,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:20:00,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:20:00,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:20:00,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:20:00,957 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:20:00,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:20:00,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:20:00,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:20:00,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:20:00,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:20:00,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:20:00,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:20:00,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:20:00,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:20:00,961 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:01,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:20:01,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:20:01,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:20:01,182 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:20:01,183 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:20:01,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2023-11-30 03:20:02,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:20:02,317 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:20:02,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2023-11-30 03:20:02,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a5a1a0/f8427a61429f4d63b7f4a7ae01f635fb/FLAG174d69927 [2023-11-30 03:20:02,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a5a1a0/f8427a61429f4d63b7f4a7ae01f635fb [2023-11-30 03:20:02,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:20:02,345 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:20:02,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:20:02,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:20:02,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:20:02,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:20:02" (1/1) ... [2023-11-30 03:20:02,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dca08b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:02, skipping insertion in model container [2023-11-30 03:20:02,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:20:02" (1/1) ... [2023-11-30 03:20:02,379 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:20:02,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:20:02,546 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:20:02,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:20:02,594 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:20:02,594 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:20:02,599 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:20:02,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:02 WrapperNode [2023-11-30 03:20:02,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:20:02,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:20:02,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:20:02,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:20:02,605 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:02" (1/1) ... [2023-11-30 03:20:02,617 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:02" (1/1) ... [2023-11-30 03:20:02,650 INFO L138 Inliner]: procedures = 27, calls = 88, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 696 [2023-11-30 03:20:02,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:20:02,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:20:02,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:20:02,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:20:02,657 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:02" (1/1) ... [2023-11-30 03:20:02,657 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:02" (1/1) ... [2023-11-30 03:20:02,663 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:02" (1/1) ... [2023-11-30 03:20:02,663 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:02" (1/1) ... [2023-11-30 03:20:02,678 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:02" (1/1) ... [2023-11-30 03:20:02,683 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:02" (1/1) ... [2023-11-30 03:20:02,685 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:02" (1/1) ... [2023-11-30 03:20:02,687 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:02" (1/1) ... [2023-11-30 03:20:02,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:20:02,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:20:02,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:20:02,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:20:02,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:02" (1/1) ... [2023-11-30 03:20:02,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:20:02,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:20:02,730 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:02,758 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:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:20:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:20:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:20:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:20:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:20:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:20:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:20:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:20:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:20:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:20:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:20:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:20:02,768 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:02,886 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:20:02,888 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:20:03,628 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:20:04,085 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:20:04,085 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-30 03:20:04,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:20:04 BoogieIcfgContainer [2023-11-30 03:20:04,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:20:04,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:20:04,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:20:04,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:20:04,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:20:02" (1/3) ... [2023-11-30 03:20:04,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b3d53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:20:04, skipping insertion in model container [2023-11-30 03:20:04,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:20:02" (2/3) ... [2023-11-30 03:20:04,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b3d53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:20:04, skipping insertion in model container [2023-11-30 03:20:04,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:20:04" (3/3) ... [2023-11-30 03:20:04,093 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2023-11-30 03:20:04,107 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:20:04,108 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2023-11-30 03:20:04,108 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:20:04,227 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:20:04,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 469 places, 478 transitions, 984 flow [2023-11-30 03:20:04,415 INFO L124 PetriNetUnfolderBase]: 22/474 cut-off events. [2023-11-30 03:20:04,415 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:20:04,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 474 events. 22/474 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 679 event pairs, 0 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 385. Up to 2 conditions per place. [2023-11-30 03:20:04,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 469 places, 478 transitions, 984 flow [2023-11-30 03:20:04,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 441 places, 449 transitions, 922 flow [2023-11-30 03:20:04,448 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:20:04,454 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;@3cce29a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:20:04,455 INFO L363 AbstractCegarLoop]: Starting to check reachability of 186 error locations. [2023-11-30 03:20:04,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:20:04,460 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2023-11-30 03:20:04,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:20:04,460 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:04,460 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:04,461 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:04,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash -199934051, now seen corresponding path program 1 times [2023-11-30 03:20:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772247988] [2023-11-30 03:20:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:04,628 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:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772247988] [2023-11-30 03:20:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772247988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:04,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:04,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67042903] [2023-11-30 03:20:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:04,636 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:04,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:04,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 478 [2023-11-30 03:20:04,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 449 transitions, 922 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:04,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:04,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 478 [2023-11-30 03:20:04,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:05,211 INFO L124 PetriNetUnfolderBase]: 745/1780 cut-off events. [2023-11-30 03:20:05,212 INFO L125 PetriNetUnfolderBase]: For 243/371 co-relation queries the response was YES. [2023-11-30 03:20:05,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 1780 events. 745/1780 cut-off events. For 243/371 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9097 event pairs, 485 based on Foata normal form. 267/1864 useless extension candidates. Maximal degree in co-relation 2527. Up to 1013 conditions per place. [2023-11-30 03:20:05,229 INFO L140 encePairwiseOnDemand]: 382/478 looper letters, 31 selfloop transitions, 2 changer transitions 7/355 dead transitions. [2023-11-30 03:20:05,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 800 flow [2023-11-30 03:20:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1171 transitions. [2023-11-30 03:20:05,244 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8165969316596932 [2023-11-30 03:20:05,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1171 transitions. [2023-11-30 03:20:05,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1171 transitions. [2023-11-30 03:20:05,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:05,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1171 transitions. [2023-11-30 03:20:05,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 390.3333333333333) internal successors, (1171), 3 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call 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:05,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:05,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:05,264 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -78 predicate places. [2023-11-30 03:20:05,264 INFO L500 AbstractCegarLoop]: Abstraction has has 363 places, 355 transitions, 800 flow [2023-11-30 03:20:05,265 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:05,266 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:05,266 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:05,266 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:20:05,266 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:05,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash -918586815, now seen corresponding path program 1 times [2023-11-30 03:20:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:05,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505568034] [2023-11-30 03:20:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:05,352 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:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505568034] [2023-11-30 03:20:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505568034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120964281] [2023-11-30 03:20:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:05,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:05,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:05,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:05,355 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 478 [2023-11-30 03:20:05,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 355 transitions, 800 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:05,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:05,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 478 [2023-11-30 03:20:05,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:05,777 INFO L124 PetriNetUnfolderBase]: 745/1779 cut-off events. [2023-11-30 03:20:05,777 INFO L125 PetriNetUnfolderBase]: For 589/4503 co-relation queries the response was YES. [2023-11-30 03:20:05,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 1779 events. 745/1779 cut-off events. For 589/4503 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9097 event pairs, 485 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 3487. Up to 1013 conditions per place. [2023-11-30 03:20:05,791 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 28 selfloop transitions, 2 changer transitions 7/354 dead transitions. [2023-11-30 03:20:05,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 354 transitions, 858 flow [2023-11-30 03:20:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2023-11-30 03:20:05,793 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7559274755927475 [2023-11-30 03:20:05,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1084 transitions. [2023-11-30 03:20:05,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1084 transitions. [2023-11-30 03:20:05,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:05,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1084 transitions. [2023-11-30 03:20:05,796 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:05,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:05,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:05,799 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -77 predicate places. [2023-11-30 03:20:05,799 INFO L500 AbstractCegarLoop]: Abstraction has has 364 places, 354 transitions, 858 flow [2023-11-30 03:20:05,800 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:05,800 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:05,800 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:05,801 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:20:05,801 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:05,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1728768623, now seen corresponding path program 1 times [2023-11-30 03:20:05,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294046539] [2023-11-30 03:20:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:05,904 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:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:05,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294046539] [2023-11-30 03:20:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294046539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056741991] [2023-11-30 03:20:05,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:05,906 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:05,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:05,908 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 478 [2023-11-30 03:20:05,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 354 transitions, 858 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:05,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:05,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 478 [2023-11-30 03:20:05,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:06,264 INFO L124 PetriNetUnfolderBase]: 745/1778 cut-off events. [2023-11-30 03:20:06,264 INFO L125 PetriNetUnfolderBase]: For 1168/8868 co-relation queries the response was YES. [2023-11-30 03:20:06,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 1778 events. 745/1778 cut-off events. For 1168/8868 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9118 event pairs, 485 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 4447. Up to 1013 conditions per place. [2023-11-30 03:20:06,282 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 28 selfloop transitions, 2 changer transitions 7/353 dead transitions. [2023-11-30 03:20:06,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 353 transitions, 916 flow [2023-11-30 03:20:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2023-11-30 03:20:06,284 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7559274755927475 [2023-11-30 03:20:06,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1084 transitions. [2023-11-30 03:20:06,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1084 transitions. [2023-11-30 03:20:06,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:06,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1084 transitions. [2023-11-30 03:20:06,288 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:06,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:06,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:06,292 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -76 predicate places. [2023-11-30 03:20:06,292 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 353 transitions, 916 flow [2023-11-30 03:20:06,293 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:06,293 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:06,293 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:06,293 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:20:06,293 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:06,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash -748680843, now seen corresponding path program 1 times [2023-11-30 03:20:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43968592] [2023-11-30 03:20:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:06,365 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:06,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43968592] [2023-11-30 03:20:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43968592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:06,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:06,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670330267] [2023-11-30 03:20:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:06,366 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:06,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:06,368 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 478 [2023-11-30 03:20:06,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 353 transitions, 916 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:06,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:06,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 478 [2023-11-30 03:20:06,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:06,734 INFO L124 PetriNetUnfolderBase]: 745/1777 cut-off events. [2023-11-30 03:20:06,734 INFO L125 PetriNetUnfolderBase]: For 1980/13466 co-relation queries the response was YES. [2023-11-30 03:20:06,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 1777 events. 745/1777 cut-off events. For 1980/13466 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9130 event pairs, 485 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 5407. Up to 1013 conditions per place. [2023-11-30 03:20:06,751 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 28 selfloop transitions, 2 changer transitions 7/352 dead transitions. [2023-11-30 03:20:06,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 352 transitions, 974 flow [2023-11-30 03:20:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2023-11-30 03:20:06,753 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7559274755927475 [2023-11-30 03:20:06,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1084 transitions. [2023-11-30 03:20:06,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1084 transitions. [2023-11-30 03:20:06,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:06,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1084 transitions. [2023-11-30 03:20:06,756 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:06,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:06,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:06,759 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -75 predicate places. [2023-11-30 03:20:06,759 INFO L500 AbstractCegarLoop]: Abstraction has has 366 places, 352 transitions, 974 flow [2023-11-30 03:20:06,760 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:06,760 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:06,760 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:06,760 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:20:06,760 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:06,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1404981593, now seen corresponding path program 1 times [2023-11-30 03:20:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690191466] [2023-11-30 03:20:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:06,789 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:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690191466] [2023-11-30 03:20:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690191466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:06,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:06,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063797027] [2023-11-30 03:20:06,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:06,791 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:06,792 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 478 [2023-11-30 03:20:06,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 352 transitions, 974 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:06,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:06,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 478 [2023-11-30 03:20:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:07,244 INFO L124 PetriNetUnfolderBase]: 982/2713 cut-off events. [2023-11-30 03:20:07,244 INFO L125 PetriNetUnfolderBase]: For 4442/15541 co-relation queries the response was YES. [2023-11-30 03:20:07,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9614 conditions, 2713 events. 982/2713 cut-off events. For 4442/15541 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17928 event pairs, 392 based on Foata normal form. 0/2411 useless extension candidates. Maximal degree in co-relation 8813. Up to 1333 conditions per place. [2023-11-30 03:20:07,271 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 41 selfloop transitions, 2 changer transitions 7/368 dead transitions. [2023-11-30 03:20:07,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 368 transitions, 1241 flow [2023-11-30 03:20:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2023-11-30 03:20:07,273 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7733612273361228 [2023-11-30 03:20:07,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1109 transitions. [2023-11-30 03:20:07,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1109 transitions. [2023-11-30 03:20:07,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:07,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1109 transitions. [2023-11-30 03:20:07,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call 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:07,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:07,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:07,331 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -74 predicate places. [2023-11-30 03:20:07,331 INFO L500 AbstractCegarLoop]: Abstraction has has 367 places, 368 transitions, 1241 flow [2023-11-30 03:20:07,332 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:07,332 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:07,332 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:07,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:20:07,332 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:07,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1154980913, now seen corresponding path program 1 times [2023-11-30 03:20:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227644789] [2023-11-30 03:20:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:07,368 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:07,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227644789] [2023-11-30 03:20:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227644789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:07,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300289298] [2023-11-30 03:20:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:07,369 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:07,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:07,371 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 478 [2023-11-30 03:20:07,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 368 transitions, 1241 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:07,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:07,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 478 [2023-11-30 03:20:07,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:07,844 INFO L124 PetriNetUnfolderBase]: 982/2712 cut-off events. [2023-11-30 03:20:07,844 INFO L125 PetriNetUnfolderBase]: For 6342/20189 co-relation queries the response was YES. [2023-11-30 03:20:07,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 2712 events. 982/2712 cut-off events. For 6342/20189 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17876 event pairs, 392 based on Foata normal form. 0/2411 useless extension candidates. Maximal degree in co-relation 10077. Up to 1333 conditions per place. [2023-11-30 03:20:07,872 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 42 selfloop transitions, 2 changer transitions 7/367 dead transitions. [2023-11-30 03:20:07,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 367 transitions, 1327 flow [2023-11-30 03:20:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:07,875 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7601115760111576 [2023-11-30 03:20:07,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:07,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:07,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:07,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:07,878 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:07,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:07,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:07,883 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -73 predicate places. [2023-11-30 03:20:07,883 INFO L500 AbstractCegarLoop]: Abstraction has has 368 places, 367 transitions, 1327 flow [2023-11-30 03:20:07,884 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:07,884 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:07,884 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:07,885 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:20:07,885 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:07,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1517481451, now seen corresponding path program 1 times [2023-11-30 03:20:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183800241] [2023-11-30 03:20:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:07,925 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:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183800241] [2023-11-30 03:20:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183800241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822830554] [2023-11-30 03:20:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:07,926 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:07,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:07,927 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 478 [2023-11-30 03:20:07,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 367 transitions, 1327 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:07,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:07,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 478 [2023-11-30 03:20:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:08,381 INFO L124 PetriNetUnfolderBase]: 982/2441 cut-off events. [2023-11-30 03:20:08,382 INFO L125 PetriNetUnfolderBase]: For 7984/38892 co-relation queries the response was YES. [2023-11-30 03:20:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12003 conditions, 2441 events. 982/2441 cut-off events. For 7984/38892 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14551 event pairs, 310 based on Foata normal form. 0/2184 useless extension candidates. Maximal degree in co-relation 11047. Up to 1333 conditions per place. [2023-11-30 03:20:08,410 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 45 selfloop transitions, 2 changer transitions 7/366 dead transitions. [2023-11-30 03:20:08,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 366 transitions, 1419 flow [2023-11-30 03:20:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2023-11-30 03:20:08,413 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7559274755927475 [2023-11-30 03:20:08,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1084 transitions. [2023-11-30 03:20:08,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1084 transitions. [2023-11-30 03:20:08,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:08,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1084 transitions. [2023-11-30 03:20:08,416 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:08,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:08,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:08,419 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -72 predicate places. [2023-11-30 03:20:08,419 INFO L500 AbstractCegarLoop]: Abstraction has has 369 places, 366 transitions, 1419 flow [2023-11-30 03:20:08,420 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:08,420 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:08,420 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:08,420 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:20:08,421 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:08,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash -297870246, now seen corresponding path program 1 times [2023-11-30 03:20:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:08,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203264206] [2023-11-30 03:20:08,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:08,473 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:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203264206] [2023-11-30 03:20:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203264206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881853543] [2023-11-30 03:20:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:08,474 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:08,475 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 478 [2023-11-30 03:20:08,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 366 transitions, 1419 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:08,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:08,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 478 [2023-11-30 03:20:08,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:09,055 INFO L124 PetriNetUnfolderBase]: 1232/3072 cut-off events. [2023-11-30 03:20:09,055 INFO L125 PetriNetUnfolderBase]: For 11476/53361 co-relation queries the response was YES. [2023-11-30 03:20:09,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16689 conditions, 3072 events. 1232/3072 cut-off events. For 11476/53361 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19739 event pairs, 242 based on Foata normal form. 1/2759 useless extension candidates. Maximal degree in co-relation 15530. Up to 1671 conditions per place. [2023-11-30 03:20:09,090 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 70 selfloop transitions, 3 changer transitions 7/395 dead transitions. [2023-11-30 03:20:09,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 395 transitions, 2065 flow [2023-11-30 03:20:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2023-11-30 03:20:09,092 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7726638772663877 [2023-11-30 03:20:09,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1108 transitions. [2023-11-30 03:20:09,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1108 transitions. [2023-11-30 03:20:09,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:09,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1108 transitions. [2023-11-30 03:20:09,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:09,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:09,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:09,097 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -71 predicate places. [2023-11-30 03:20:09,097 INFO L500 AbstractCegarLoop]: Abstraction has has 370 places, 395 transitions, 2065 flow [2023-11-30 03:20:09,097 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:09,097 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:09,098 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:09,098 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:20:09,098 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:09,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -995984822, now seen corresponding path program 1 times [2023-11-30 03:20:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632833552] [2023-11-30 03:20:09,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:09,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:09,120 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:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:09,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632833552] [2023-11-30 03:20:09,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632833552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:09,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:09,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870576852] [2023-11-30 03:20:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:09,121 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:09,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:09,123 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 478 [2023-11-30 03:20:09,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 395 transitions, 2065 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:09,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:09,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 478 [2023-11-30 03:20:09,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:09,685 INFO L124 PetriNetUnfolderBase]: 1232/3071 cut-off events. [2023-11-30 03:20:09,685 INFO L125 PetriNetUnfolderBase]: For 14676/65701 co-relation queries the response was YES. [2023-11-30 03:20:09,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18355 conditions, 3071 events. 1232/3071 cut-off events. For 14676/65701 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 19689 event pairs, 242 based on Foata normal form. 1/2759 useless extension candidates. Maximal degree in co-relation 17114. Up to 1671 conditions per place. [2023-11-30 03:20:09,723 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 72 selfloop transitions, 2 changer transitions 7/394 dead transitions. [2023-11-30 03:20:09,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 394 transitions, 2211 flow [2023-11-30 03:20:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:09,725 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7601115760111576 [2023-11-30 03:20:09,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:09,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:09,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:09,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:09,727 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:09,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:09,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:09,730 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -70 predicate places. [2023-11-30 03:20:09,730 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 394 transitions, 2211 flow [2023-11-30 03:20:09,730 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:09,730 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:09,730 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:09,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:20:09,730 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:09,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1747549243, now seen corresponding path program 1 times [2023-11-30 03:20:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286710832] [2023-11-30 03:20:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:09,751 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:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:09,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286710832] [2023-11-30 03:20:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286710832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:09,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277307826] [2023-11-30 03:20:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:09,752 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:09,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:09,753 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 478 [2023-11-30 03:20:09,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 394 transitions, 2211 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:09,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:09,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 478 [2023-11-30 03:20:09,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:10,271 INFO L124 PetriNetUnfolderBase]: 1232/2878 cut-off events. [2023-11-30 03:20:10,271 INFO L125 PetriNetUnfolderBase]: For 20046/100479 co-relation queries the response was YES. [2023-11-30 03:20:10,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19827 conditions, 2878 events. 1232/2878 cut-off events. For 20046/100479 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17953 event pairs, 221 based on Foata normal form. 5/2595 useless extension candidates. Maximal degree in co-relation 18514. Up to 1671 conditions per place. [2023-11-30 03:20:10,306 INFO L140 encePairwiseOnDemand]: 476/478 looper letters, 72 selfloop transitions, 1 changer transitions 7/393 dead transitions. [2023-11-30 03:20:10,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 393 transitions, 2353 flow [2023-11-30 03:20:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:10,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2023-11-30 03:20:10,308 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7615062761506276 [2023-11-30 03:20:10,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1092 transitions. [2023-11-30 03:20:10,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1092 transitions. [2023-11-30 03:20:10,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:10,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1092 transitions. [2023-11-30 03:20:10,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:10,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:10,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:10,313 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -69 predicate places. [2023-11-30 03:20:10,313 INFO L500 AbstractCegarLoop]: Abstraction has has 372 places, 393 transitions, 2353 flow [2023-11-30 03:20:10,313 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:10,313 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:10,314 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:10,314 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:20:10,314 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:10,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1508406651, now seen corresponding path program 1 times [2023-11-30 03:20:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251501824] [2023-11-30 03:20:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:10,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:10,341 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:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:10,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251501824] [2023-11-30 03:20:10,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251501824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:10,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:10,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:10,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723520873] [2023-11-30 03:20:10,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:10,342 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:10,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:10,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:10,344 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 478 [2023-11-30 03:20:10,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 393 transitions, 2353 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:10,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:10,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 478 [2023-11-30 03:20:10,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:10,909 INFO L124 PetriNetUnfolderBase]: 1232/3359 cut-off events. [2023-11-30 03:20:10,909 INFO L125 PetriNetUnfolderBase]: For 25380/63557 co-relation queries the response was YES. [2023-11-30 03:20:10,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21975 conditions, 3359 events. 1232/3359 cut-off events. For 25380/63557 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23740 event pairs, 286 based on Foata normal form. 0/2994 useless extension candidates. Maximal degree in co-relation 20568. Up to 1671 conditions per place. [2023-11-30 03:20:10,955 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 72 selfloop transitions, 2 changer transitions 7/392 dead transitions. [2023-11-30 03:20:10,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 392 transitions, 2499 flow [2023-11-30 03:20:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:10,958 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7601115760111576 [2023-11-30 03:20:10,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:10,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:10,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:10,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:10,960 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:10,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:10,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:10,962 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -68 predicate places. [2023-11-30 03:20:10,962 INFO L500 AbstractCegarLoop]: Abstraction has has 373 places, 392 transitions, 2499 flow [2023-11-30 03:20:10,963 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:10,963 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:10,963 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:10,963 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:20:10,963 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:10,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1869210023, now seen corresponding path program 1 times [2023-11-30 03:20:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188444442] [2023-11-30 03:20:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:10,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:11,364 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:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188444442] [2023-11-30 03:20:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188444442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12791410] [2023-11-30 03:20:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:11,365 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:11,367 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 478 [2023-11-30 03:20:11,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 392 transitions, 2499 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:11,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:11,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 478 [2023-11-30 03:20:11,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:14,591 INFO L124 PetriNetUnfolderBase]: 8768/13896 cut-off events. [2023-11-30 03:20:14,592 INFO L125 PetriNetUnfolderBase]: For 398288/401534 co-relation queries the response was YES. [2023-11-30 03:20:14,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126724 conditions, 13896 events. 8768/13896 cut-off events. For 398288/401534 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 87344 event pairs, 2915 based on Foata normal form. 0/12915 useless extension candidates. Maximal degree in co-relation 124496. Up to 11301 conditions per place. [2023-11-30 03:20:14,826 INFO L140 encePairwiseOnDemand]: 460/478 looper letters, 132 selfloop transitions, 15 changer transitions 7/389 dead transitions. [2023-11-30 03:20:14,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 389 transitions, 2787 flow [2023-11-30 03:20:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1783 transitions. [2023-11-30 03:20:14,830 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6216875871687587 [2023-11-30 03:20:14,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1783 transitions. [2023-11-30 03:20:14,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1783 transitions. [2023-11-30 03:20:14,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:14,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1783 transitions. [2023-11-30 03:20:14,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 297.1666666666667) internal successors, (1783), 6 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call 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:14,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:14,837 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:14,838 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -66 predicate places. [2023-11-30 03:20:14,838 INFO L500 AbstractCegarLoop]: Abstraction has has 375 places, 389 transitions, 2787 flow [2023-11-30 03:20:14,839 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:14,839 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:14,839 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:20:14,839 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:20:14,839 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:14,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1587349414, now seen corresponding path program 1 times [2023-11-30 03:20:14,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435174688] [2023-11-30 03:20:14,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:14,869 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:14,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435174688] [2023-11-30 03:20:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435174688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:14,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843748014] [2023-11-30 03:20:14,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:14,872 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:14,873 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 478 [2023-11-30 03:20:14,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 389 transitions, 2787 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:14,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:14,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 478 [2023-11-30 03:20:14,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:17,827 INFO L124 PetriNetUnfolderBase]: 8768/13895 cut-off events. [2023-11-30 03:20:17,827 INFO L125 PetriNetUnfolderBase]: For 470597/474209 co-relation queries the response was YES. [2023-11-30 03:20:17,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135924 conditions, 13895 events. 8768/13895 cut-off events. For 470597/474209 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 87207 event pairs, 2915 based on Foata normal form. 0/12915 useless extension candidates. Maximal degree in co-relation 133568. Up to 11301 conditions per place. [2023-11-30 03:20:18,039 INFO L140 encePairwiseOnDemand]: 476/478 looper letters, 72 selfloop transitions, 1 changer transitions 7/388 dead transitions. [2023-11-30 03:20:18,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 388 transitions, 2929 flow [2023-11-30 03:20:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1092 transitions. [2023-11-30 03:20:18,043 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7615062761506276 [2023-11-30 03:20:18,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1092 transitions. [2023-11-30 03:20:18,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1092 transitions. [2023-11-30 03:20:18,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:18,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1092 transitions. [2023-11-30 03:20:18,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:18,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:18,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:18,048 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -65 predicate places. [2023-11-30 03:20:18,048 INFO L500 AbstractCegarLoop]: Abstraction has has 376 places, 388 transitions, 2929 flow [2023-11-30 03:20:18,048 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:18,048 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:18,048 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:18,048 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:20:18,048 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:18,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1717678273, now seen corresponding path program 1 times [2023-11-30 03:20:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18847262] [2023-11-30 03:20:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:18,081 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:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18847262] [2023-11-30 03:20:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18847262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639830454] [2023-11-30 03:20:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:18,082 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:18,084 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 478 [2023-11-30 03:20:18,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 388 transitions, 2929 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:18,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:18,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 478 [2023-11-30 03:20:18,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:21,228 INFO L124 PetriNetUnfolderBase]: 8768/13894 cut-off events. [2023-11-30 03:20:21,228 INFO L125 PetriNetUnfolderBase]: For 548935/552913 co-relation queries the response was YES. [2023-11-30 03:20:21,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145126 conditions, 13894 events. 8768/13894 cut-off events. For 548935/552913 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 87159 event pairs, 2915 based on Foata normal form. 0/12915 useless extension candidates. Maximal degree in co-relation 142640. Up to 11301 conditions per place. [2023-11-30 03:20:21,443 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 72 selfloop transitions, 2 changer transitions 7/387 dead transitions. [2023-11-30 03:20:21,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 387 transitions, 3075 flow [2023-11-30 03:20:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:21,445 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7601115760111576 [2023-11-30 03:20:21,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:21,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:21,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:21,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:21,447 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:21,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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,449 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -64 predicate places. [2023-11-30 03:20:21,449 INFO L500 AbstractCegarLoop]: Abstraction has has 377 places, 387 transitions, 3075 flow [2023-11-30 03:20:21,450 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:21,450 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:21,450 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:21,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:20:21,450 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:21,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:21,450 INFO L85 PathProgramCache]: Analyzing trace with hash -85618972, now seen corresponding path program 1 times [2023-11-30 03:20:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:21,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822092621] [2023-11-30 03:20:21,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:21,479 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,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:21,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822092621] [2023-11-30 03:20:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822092621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:21,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001169395] [2023-11-30 03:20:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:21,480 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:21,481 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 478 [2023-11-30 03:20:21,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 387 transitions, 3075 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:21,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:21,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 478 [2023-11-30 03:20:21,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:24,509 INFO L124 PetriNetUnfolderBase]: 8768/13892 cut-off events. [2023-11-30 03:20:24,509 INFO L125 PetriNetUnfolderBase]: For 633289/637633 co-relation queries the response was YES. [2023-11-30 03:20:24,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154326 conditions, 13892 events. 8768/13892 cut-off events. For 633289/637633 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 87280 event pairs, 2915 based on Foata normal form. 0/12915 useless extension candidates. Maximal degree in co-relation 151712. Up to 11301 conditions per place. [2023-11-30 03:20:24,742 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 74 selfloop transitions, 1 changer transitions 7/385 dead transitions. [2023-11-30 03:20:24,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 385 transitions, 3217 flow [2023-11-30 03:20:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions. [2023-11-30 03:20:24,744 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7573221757322176 [2023-11-30 03:20:24,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1086 transitions. [2023-11-30 03:20:24,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1086 transitions. [2023-11-30 03:20:24,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:24,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1086 transitions. [2023-11-30 03:20:24,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call 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,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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,748 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -64 predicate places. [2023-11-30 03:20:24,748 INFO L500 AbstractCegarLoop]: Abstraction has has 377 places, 385 transitions, 3217 flow [2023-11-30 03:20:24,748 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:24,748 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:24,748 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:24,748 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:20:24,748 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:24,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash -971956464, now seen corresponding path program 1 times [2023-11-30 03:20:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101491491] [2023-11-30 03:20:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:24,800 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,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101491491] [2023-11-30 03:20:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101491491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084145407] [2023-11-30 03:20:24,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:24,801 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:24,802 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 478 [2023-11-30 03:20:24,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 385 transitions, 3217 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,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:24,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 478 [2023-11-30 03:20:24,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:28,000 INFO L124 PetriNetUnfolderBase]: 8768/14119 cut-off events. [2023-11-30 03:20:28,000 INFO L125 PetriNetUnfolderBase]: For 750672/755562 co-relation queries the response was YES. [2023-11-30 03:20:28,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163756 conditions, 14119 events. 8768/14119 cut-off events. For 750672/755562 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 90830 event pairs, 2974 based on Foata normal form. 0/13084 useless extension candidates. Maximal degree in co-relation 161012. Up to 11301 conditions per place. [2023-11-30 03:20:28,242 INFO L140 encePairwiseOnDemand]: 475/478 looper letters, 72 selfloop transitions, 2 changer transitions 7/384 dead transitions. [2023-11-30 03:20:28,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 384 transitions, 3363 flow [2023-11-30 03:20:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2023-11-30 03:20:28,245 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7601115760111576 [2023-11-30 03:20:28,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2023-11-30 03:20:28,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2023-11-30 03:20:28,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:28,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2023-11-30 03:20:28,247 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:28,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:28,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:28,249 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -63 predicate places. [2023-11-30 03:20:28,249 INFO L500 AbstractCegarLoop]: Abstraction has has 378 places, 384 transitions, 3363 flow [2023-11-30 03:20:28,249 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:28,249 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:28,249 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:28,249 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:20:28,249 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:28,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash 471448890, now seen corresponding path program 1 times [2023-11-30 03:20:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:28,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131647074] [2023-11-30 03:20:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:28,743 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:28,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:28,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131647074] [2023-11-30 03:20:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131647074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:28,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368127049] [2023-11-30 03:20:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:28,745 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:28,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:28,747 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 478 [2023-11-30 03:20:28,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 384 transitions, 3363 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:28,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:28,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 478 [2023-11-30 03:20:28,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:32,429 INFO L124 PetriNetUnfolderBase]: 8768/12994 cut-off events. [2023-11-30 03:20:32,429 INFO L125 PetriNetUnfolderBase]: For 843433/848509 co-relation queries the response was YES. [2023-11-30 03:20:32,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173655 conditions, 12994 events. 8768/12994 cut-off events. For 843433/848509 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 72723 event pairs, 540 based on Foata normal form. 0/12553 useless extension candidates. Maximal degree in co-relation 170727. Up to 11045 conditions per place. [2023-11-30 03:20:32,671 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 299 selfloop transitions, 4 changer transitions 7/575 dead transitions. [2023-11-30 03:20:32,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 575 transitions, 10493 flow [2023-11-30 03:20:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2023-11-30 03:20:32,675 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6949093444909344 [2023-11-30 03:20:32,675 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1993 transitions. [2023-11-30 03:20:32,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1993 transitions. [2023-11-30 03:20:32,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:32,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1993 transitions. [2023-11-30 03:20:32,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 332.1666666666667) internal successors, (1993), 6 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call 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:32,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:32,681 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:32,682 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -59 predicate places. [2023-11-30 03:20:32,682 INFO L500 AbstractCegarLoop]: Abstraction has has 382 places, 575 transitions, 10493 flow [2023-11-30 03:20:32,682 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:32,682 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:32,682 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:32,682 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:20:32,682 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:32,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1143389958, now seen corresponding path program 1 times [2023-11-30 03:20:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:32,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75255728] [2023-11-30 03:20:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:33,317 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,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75255728] [2023-11-30 03:20:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75255728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779336471] [2023-11-30 03:20:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:33,318 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:33,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:33,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:33,320 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 478 [2023-11-30 03:20:33,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 575 transitions, 10493 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:33,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:33,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 478 [2023-11-30 03:20:33,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:36,974 INFO L124 PetriNetUnfolderBase]: 8772/12990 cut-off events. [2023-11-30 03:20:36,975 INFO L125 PetriNetUnfolderBase]: For 864722/871626 co-relation queries the response was YES. [2023-11-30 03:20:37,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184622 conditions, 12990 events. 8772/12990 cut-off events. For 864722/871626 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 72071 event pairs, 543 based on Foata normal form. 0/12592 useless extension candidates. Maximal degree in co-relation 149357. Up to 10985 conditions per place. [2023-11-30 03:20:37,244 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 426 selfloop transitions, 4 changer transitions 7/702 dead transitions. [2023-11-30 03:20:37,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 702 transitions, 15955 flow [2023-11-30 03:20:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1976 transitions. [2023-11-30 03:20:37,248 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6889818688981869 [2023-11-30 03:20:37,248 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1976 transitions. [2023-11-30 03:20:37,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1976 transitions. [2023-11-30 03:20:37,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:37,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1976 transitions. [2023-11-30 03:20:37,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 329.3333333333333) internal successors, (1976), 6 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:20:37,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:37,254 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:37,254 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -55 predicate places. [2023-11-30 03:20:37,254 INFO L500 AbstractCegarLoop]: Abstraction has has 386 places, 702 transitions, 15955 flow [2023-11-30 03:20:37,255 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:37,255 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:37,255 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:37,255 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:20:37,255 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:37,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2083377696, now seen corresponding path program 1 times [2023-11-30 03:20:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:37,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827461561] [2023-11-30 03:20:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:37,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:37,853 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:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:37,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827461561] [2023-11-30 03:20:37,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827461561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:37,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:37,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938442260] [2023-11-30 03:20:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:37,854 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:37,856 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 478 [2023-11-30 03:20:37,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 702 transitions, 15955 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:37,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:37,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 478 [2023-11-30 03:20:37,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:41,681 INFO L124 PetriNetUnfolderBase]: 8804/13334 cut-off events. [2023-11-30 03:20:41,681 INFO L125 PetriNetUnfolderBase]: For 924740/931844 co-relation queries the response was YES. [2023-11-30 03:20:41,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196505 conditions, 13334 events. 8804/13334 cut-off events. For 924740/931844 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 76784 event pairs, 599 based on Foata normal form. 0/12852 useless extension candidates. Maximal degree in co-relation 159105. Up to 11001 conditions per place. [2023-11-30 03:20:41,925 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 489 selfloop transitions, 4 changer transitions 7/765 dead transitions. [2023-11-30 03:20:41,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 765 transitions, 19365 flow [2023-11-30 03:20:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1959 transitions. [2023-11-30 03:20:41,929 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6830543933054394 [2023-11-30 03:20:41,929 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1959 transitions. [2023-11-30 03:20:41,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1959 transitions. [2023-11-30 03:20:41,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:41,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1959 transitions. [2023-11-30 03:20:41,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call 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,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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,935 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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,935 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -51 predicate places. [2023-11-30 03:20:41,935 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 765 transitions, 19365 flow [2023-11-30 03:20:41,935 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:41,935 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:41,936 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:41,936 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:20:41,936 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:41,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash 121569843, now seen corresponding path program 1 times [2023-11-30 03:20:41,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:41,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758101921] [2023-11-30 03:20:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:41,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:42,514 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,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:42,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758101921] [2023-11-30 03:20:42,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758101921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:20:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92366291] [2023-11-30 03:20:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:42,515 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:20:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:42,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:20:42,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:20:42,517 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 478 [2023-11-30 03:20:42,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 765 transitions, 19365 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:42,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:42,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 478 [2023-11-30 03:20:42,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:47,114 INFO L124 PetriNetUnfolderBase]: 8996/13438 cut-off events. [2023-11-30 03:20:47,114 INFO L125 PetriNetUnfolderBase]: For 923188/923188 co-relation queries the response was YES. [2023-11-30 03:20:47,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211460 conditions, 13438 events. 8996/13438 cut-off events. For 923188/923188 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 75822 event pairs, 663 based on Foata normal form. 0/13044 useless extension candidates. Maximal degree in co-relation 171917. Up to 11185 conditions per place. [2023-11-30 03:20:47,583 INFO L140 encePairwiseOnDemand]: 473/478 looper letters, 520 selfloop transitions, 4 changer transitions 7/796 dead transitions. [2023-11-30 03:20:47,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 796 transitions, 21683 flow [2023-11-30 03:20:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:20:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:20:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1946 transitions. [2023-11-30 03:20:47,586 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6785216178521618 [2023-11-30 03:20:47,586 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1946 transitions. [2023-11-30 03:20:47,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1946 transitions. [2023-11-30 03:20:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:47,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1946 transitions. [2023-11-30 03:20:47,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.3333333333333) internal successors, (1946), 6 states have internal predecessors, (1946), 0 states have call successors, (0), 0 states have call 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:47,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:47,592 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 478.0) internal successors, (3346), 7 states have internal predecessors, (3346), 0 states have call successors, (0), 0 states have call 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:47,592 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -47 predicate places. [2023-11-30 03:20:47,592 INFO L500 AbstractCegarLoop]: Abstraction has has 394 places, 796 transitions, 21683 flow [2023-11-30 03:20:47,592 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:47,593 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:20:47,593 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:20:47,593 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:47,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:20:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash -781188754, now seen corresponding path program 1 times [2023-11-30 03:20:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:20:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985135982] [2023-11-30 03:20:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:20:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:20:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:20:47,649 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:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:20:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985135982] [2023-11-30 03:20:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985135982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:20:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:20:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:20:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116558955] [2023-11-30 03:20:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:20:47,650 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:20:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:20:47,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:20:47,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:20:47,651 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 478 [2023-11-30 03:20:47,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 796 transitions, 21683 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:47,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:20:47,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 478 [2023-11-30 03:20:47,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:20:51,572 INFO L124 PetriNetUnfolderBase]: 8996/13434 cut-off events. [2023-11-30 03:20:51,572 INFO L125 PetriNetUnfolderBase]: For 1041672/1041672 co-relation queries the response was YES. [2023-11-30 03:20:51,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220886 conditions, 13434 events. 8996/13434 cut-off events. For 1041672/1041672 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 75754 event pairs, 663 based on Foata normal form. 4/13044 useless extension candidates. Maximal degree in co-relation 179625. Up to 11185 conditions per place. [2023-11-30 03:20:51,668 INFO L140 encePairwiseOnDemand]: 476/478 looper letters, 0 selfloop transitions, 0 changer transitions 795/795 dead transitions. [2023-11-30 03:20:51,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 795 transitions, 22653 flow [2023-11-30 03:20:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:20:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:20:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1098 transitions. [2023-11-30 03:20:51,670 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7656903765690377 [2023-11-30 03:20:51,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1098 transitions. [2023-11-30 03:20:51,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1098 transitions. [2023-11-30 03:20:51,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:20:51,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1098 transitions. [2023-11-30 03:20:51,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call 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:51,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:51,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 478.0) internal successors, (1912), 4 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call 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:51,673 INFO L307 CegarLoopForPetriNet]: 441 programPoint places, -46 predicate places. [2023-11-30 03:20:51,673 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 795 transitions, 22653 flow [2023-11-30 03:20:51,674 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:51,684 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-buffer-series.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:20:51,757 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (185 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (184 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (183 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (182 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (181 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (180 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (178 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (177 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (176 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (175 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (174 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (173 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (172 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (171 of 186 remaining) [2023-11-30 03:20:51,758 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (170 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (169 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (168 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (167 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (166 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (165 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (164 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (163 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (161 of 186 remaining) [2023-11-30 03:20:51,759 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (160 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (159 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (158 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (157 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (156 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (155 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (154 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (153 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (152 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (151 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (150 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (149 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (148 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (147 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (146 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (145 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (143 of 186 remaining) [2023-11-30 03:20:51,760 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (142 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (139 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (138 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (137 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (136 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (135 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (134 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (133 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (130 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (129 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (128 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (127 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (126 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (125 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (124 of 186 remaining) [2023-11-30 03:20:51,761 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (123 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (122 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (121 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (120 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (119 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (118 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (117 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (116 of 186 remaining) [2023-11-30 03:20:51,762 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (115 of 186 remaining) [2023-11-30 03:20:51,763 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (114 of 186 remaining) [2023-11-30 03:20:51,763 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (113 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (112 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (111 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (110 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (109 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (108 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (107 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (106 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (105 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (104 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (103 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 186 remaining) [2023-11-30 03:20:51,764 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 186 remaining) [2023-11-30 03:20:51,765 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 186 remaining) [2023-11-30 03:20:51,766 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 186 remaining) [2023-11-30 03:20:51,767 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 186 remaining) [2023-11-30 03:20:51,768 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 186 remaining) [2023-11-30 03:20:51,769 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 186 remaining) [2023-11-30 03:20:51,770 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 186 remaining) [2023-11-30 03:20:51,770 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 03:20:51,770 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:51,778 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:20:51,778 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:20:51,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:20:51 BasicIcfg [2023-11-30 03:20:51,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:20:51,784 INFO L158 Benchmark]: Toolchain (without parser) took 49439.64ms. Allocated memory was 490.7MB in the beginning and 13.9GB in the end (delta: 13.5GB). Free memory was 451.3MB in the beginning and 10.9GB in the end (delta: -10.4GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-11-30 03:20:51,785 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 320.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:20:51,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.13ms. Allocated memory is still 490.7MB. Free memory was 451.3MB in the beginning and 436.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 03:20:51,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.81ms. Allocated memory is still 490.7MB. Free memory was 436.6MB in the beginning and 431.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:20:51,785 INFO L158 Benchmark]: Boogie Preprocessor took 39.59ms. Allocated memory is still 490.7MB. Free memory was 431.8MB in the beginning and 427.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:20:51,785 INFO L158 Benchmark]: RCFGBuilder took 1395.88ms. Allocated memory is still 490.7MB. Free memory was 427.6MB in the beginning and 331.6MB in the end (delta: 95.9MB). Peak memory consumption was 100.0MB. Max. memory is 16.0GB. [2023-11-30 03:20:51,785 INFO L158 Benchmark]: TraceAbstraction took 47695.39ms. Allocated memory was 490.7MB in the beginning and 13.9GB in the end (delta: 13.5GB). Free memory was 330.6MB in the beginning and 10.9GB in the end (delta: -10.6GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-11-30 03:20:51,786 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 320.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 253.13ms. Allocated memory is still 490.7MB. Free memory was 451.3MB in the beginning and 436.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.81ms. Allocated memory is still 490.7MB. Free memory was 436.6MB in the beginning and 431.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.59ms. Allocated memory is still 490.7MB. Free memory was 431.8MB in the beginning and 427.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1395.88ms. Allocated memory is still 490.7MB. Free memory was 427.6MB in the beginning and 331.6MB in the end (delta: 95.9MB). Peak memory consumption was 100.0MB. Max. memory is 16.0GB. * TraceAbstraction took 47695.39ms. Allocated memory was 490.7MB in the beginning and 13.9GB in the end (delta: 13.5GB). Free memory was 330.6MB in the beginning and 10.9GB in the end (delta: -10.6GB). Peak memory consumption was 3.4GB. 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 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: 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: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: 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: 166]: 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: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 166]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: 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: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: 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: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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 - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: 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, 574 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: 47.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1723 IncrementalHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 251 mSDtfsCounter, 1723 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22653occurred 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:51,807 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...