/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:02:08,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:02:08,756 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:02:08,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:02:08,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:02:08,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:02:08,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:02:08,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:02:08,783 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:02:08,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:02:08,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:02:08,786 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:02:08,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:02:08,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:02:08,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:02:08,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:02:08,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:02:08,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:02:08,788 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:02:08,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:02:08,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:02:08,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:02:08,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:02:08,789 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:02:08,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:02:08,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:02:08,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:02:08,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:02:08,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:02:08,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:02:08,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:02:08,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:02:08,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:02:08,791 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:02:08,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:02:08,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:02:09,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:02:09,000 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:02:09,001 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:02:09,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-11-30 03:02:09,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:02:10,148 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:02:10,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-11-30 03:02:10,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f19ccf6/0f00cc5e4d824bc08dbf0c5ff6b8915e/FLAGe34cb5311 [2023-11-30 03:02:10,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f19ccf6/0f00cc5e4d824bc08dbf0c5ff6b8915e [2023-11-30 03:02:10,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:02:10,168 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:02:10,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:02:10,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:02:10,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:02:10,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e0f0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10, skipping insertion in model container [2023-11-30 03:02:10,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,204 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:02:10,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:02:10,361 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:02:10,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:02:10,394 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:02:10,394 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:02:10,398 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:02:10,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10 WrapperNode [2023-11-30 03:02:10,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:02:10,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:02:10,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:02:10,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:02:10,404 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:02:10" (1/1) ... [2023-11-30 03:02:10,411 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:02:10" (1/1) ... [2023-11-30 03:02:10,437 INFO L138 Inliner]: procedures = 22, calls = 111, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 670 [2023-11-30 03:02:10,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:02:10,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:02:10,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:02:10,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:02:10,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:02:10,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:02:10,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:02:10,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:02:10,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (1/1) ... [2023-11-30 03:02:10,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:02:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:02:10,497 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:02:10,508 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:02:10,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:02:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:02:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:02:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:02:10,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:02:10,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:02:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:02:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:02:10,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:02:10,527 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:02:10,624 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:02:10,626 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:02:11,193 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:02:11,393 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:02:11,393 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:02:11,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:02:11 BoogieIcfgContainer [2023-11-30 03:02:11,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:02:11,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:02:11,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:02:11,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:02:11,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:02:10" (1/3) ... [2023-11-30 03:02:11,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b5b113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:02:11, skipping insertion in model container [2023-11-30 03:02:11,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:02:10" (2/3) ... [2023-11-30 03:02:11,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b5b113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:02:11, skipping insertion in model container [2023-11-30 03:02:11,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:02:11" (3/3) ... [2023-11-30 03:02:11,400 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-11-30 03:02:11,412 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:02:11,412 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 114 error locations. [2023-11-30 03:02:11,412 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:02:11,506 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 03:02:11,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 378 transitions, 777 flow [2023-11-30 03:02:11,672 INFO L124 PetriNetUnfolderBase]: 8/375 cut-off events. [2023-11-30 03:02:11,672 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 03:02:11,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 375 events. 8/375 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 720 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 278. Up to 2 conditions per place. [2023-11-30 03:02:11,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 380 places, 378 transitions, 777 flow [2023-11-30 03:02:11,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 355 places, 352 transitions, 722 flow [2023-11-30 03:02:11,696 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:02:11,702 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;@1c122f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:02:11,702 INFO L363 AbstractCegarLoop]: Starting to check reachability of 210 error locations. [2023-11-30 03:02:11,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:02:11,710 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-30 03:02:11,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:02:11,710 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:11,710 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:02:11,710 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:11,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1184761054, now seen corresponding path program 1 times [2023-11-30 03:02:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294559245] [2023-11-30 03:02:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:11,874 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:02:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294559245] [2023-11-30 03:02:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294559245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:11,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:11,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547644805] [2023-11-30 03:02:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:11,881 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:11,909 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 378 [2023-11-30 03:02:11,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:11,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:11,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 378 [2023-11-30 03:02:11,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:13,231 INFO L124 PetriNetUnfolderBase]: 4542/8091 cut-off events. [2023-11-30 03:02:13,232 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2023-11-30 03:02:13,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15751 conditions, 8091 events. 4542/8091 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53413 event pairs, 4536 based on Foata normal form. 1/8020 useless extension candidates. Maximal degree in co-relation 15356. Up to 7105 conditions per place. [2023-11-30 03:02:13,279 INFO L140 encePairwiseOnDemand]: 281/378 looper letters, 48 selfloop transitions, 2 changer transitions 1/257 dead transitions. [2023-11-30 03:02:13,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 257 transitions, 632 flow [2023-11-30 03:02:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-11-30 03:02:13,289 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.736331569664903 [2023-11-30 03:02:13,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-11-30 03:02:13,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-11-30 03:02:13,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:13,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-11-30 03:02:13,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:13,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:13,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:13,304 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -92 predicate places. [2023-11-30 03:02:13,304 INFO L500 AbstractCegarLoop]: Abstraction has has 263 places, 257 transitions, 632 flow [2023-11-30 03:02:13,305 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:13,305 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:13,305 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] [2023-11-30 03:02:13,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:02:13,305 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:13,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1856828150, now seen corresponding path program 1 times [2023-11-30 03:02:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662207502] [2023-11-30 03:02:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:02:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662207502] [2023-11-30 03:02:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662207502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715444980] [2023-11-30 03:02:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:13,340 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:13,341 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 378 [2023-11-30 03:02:13,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 257 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:13,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:13,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 378 [2023-11-30 03:02:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:14,356 INFO L124 PetriNetUnfolderBase]: 4542/8090 cut-off events. [2023-11-30 03:02:14,356 INFO L125 PetriNetUnfolderBase]: For 876/1042 co-relation queries the response was YES. [2023-11-30 03:02:14,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22857 conditions, 8090 events. 4542/8090 cut-off events. For 876/1042 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53421 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 22402. Up to 7105 conditions per place. [2023-11-30 03:02:14,406 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 48 selfloop transitions, 2 changer transitions 1/256 dead transitions. [2023-11-30 03:02:14,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 256 transitions, 730 flow [2023-11-30 03:02:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2023-11-30 03:02:14,408 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2023-11-30 03:02:14,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2023-11-30 03:02:14,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2023-11-30 03:02:14,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:14,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2023-11-30 03:02:14,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:14,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:14,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:14,413 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -91 predicate places. [2023-11-30 03:02:14,413 INFO L500 AbstractCegarLoop]: Abstraction has has 264 places, 256 transitions, 730 flow [2023-11-30 03:02:14,413 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:14,413 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:14,413 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] [2023-11-30 03:02:14,413 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:02:14,414 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:14,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1663422166, now seen corresponding path program 1 times [2023-11-30 03:02:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:14,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900438175] [2023-11-30 03:02:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:14,443 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:02:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900438175] [2023-11-30 03:02:14,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900438175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:14,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:14,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967636827] [2023-11-30 03:02:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:14,444 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:14,446 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 378 [2023-11-30 03:02:14,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 256 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:14,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:14,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 378 [2023-11-30 03:02:14,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:15,513 INFO L124 PetriNetUnfolderBase]: 4542/8089 cut-off events. [2023-11-30 03:02:15,514 INFO L125 PetriNetUnfolderBase]: For 1076/1408 co-relation queries the response was YES. [2023-11-30 03:02:15,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29963 conditions, 8089 events. 4542/8089 cut-off events. For 1076/1408 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53287 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 29448. Up to 7105 conditions per place. [2023-11-30 03:02:15,572 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 48 selfloop transitions, 2 changer transitions 1/255 dead transitions. [2023-11-30 03:02:15,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 255 transitions, 828 flow [2023-11-30 03:02:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2023-11-30 03:02:15,574 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2023-11-30 03:02:15,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2023-11-30 03:02:15,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2023-11-30 03:02:15,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:15,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2023-11-30 03:02:15,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:15,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:15,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:15,579 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -90 predicate places. [2023-11-30 03:02:15,579 INFO L500 AbstractCegarLoop]: Abstraction has has 265 places, 255 transitions, 828 flow [2023-11-30 03:02:15,579 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:15,579 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:15,580 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] [2023-11-30 03:02:15,580 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:02:15,580 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:15,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:15,580 INFO L85 PathProgramCache]: Analyzing trace with hash -144365034, now seen corresponding path program 1 times [2023-11-30 03:02:15,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:15,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511307119] [2023-11-30 03:02:15,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:15,687 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:02:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511307119] [2023-11-30 03:02:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511307119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917790355] [2023-11-30 03:02:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:15,689 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:15,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:15,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:15,690 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 378 [2023-11-30 03:02:15,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 255 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:15,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:15,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 378 [2023-11-30 03:02:15,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:16,921 INFO L124 PetriNetUnfolderBase]: 4542/8088 cut-off events. [2023-11-30 03:02:16,921 INFO L125 PetriNetUnfolderBase]: For 1332/1830 co-relation queries the response was YES. [2023-11-30 03:02:16,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37069 conditions, 8088 events. 4542/8088 cut-off events. For 1332/1830 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53273 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 36494. Up to 7105 conditions per place. [2023-11-30 03:02:16,981 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 48 selfloop transitions, 2 changer transitions 1/254 dead transitions. [2023-11-30 03:02:16,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 254 transitions, 926 flow [2023-11-30 03:02:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2023-11-30 03:02:16,983 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2023-11-30 03:02:16,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2023-11-30 03:02:16,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2023-11-30 03:02:16,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:16,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2023-11-30 03:02:16,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:16,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:16,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:16,988 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -89 predicate places. [2023-11-30 03:02:16,988 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 254 transitions, 926 flow [2023-11-30 03:02:16,988 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:16,989 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:16,989 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] [2023-11-30 03:02:16,989 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:02:16,989 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:16,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1154018154, now seen corresponding path program 1 times [2023-11-30 03:02:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533708386] [2023-11-30 03:02:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:17,035 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:02:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533708386] [2023-11-30 03:02:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533708386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:17,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:17,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:17,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13439803] [2023-11-30 03:02:17,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:17,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:17,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:17,038 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 378 [2023-11-30 03:02:17,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 254 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:17,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:17,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 378 [2023-11-30 03:02:17,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:18,098 INFO L124 PetriNetUnfolderBase]: 4542/8087 cut-off events. [2023-11-30 03:02:18,098 INFO L125 PetriNetUnfolderBase]: For 1644/2308 co-relation queries the response was YES. [2023-11-30 03:02:18,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44175 conditions, 8087 events. 4542/8087 cut-off events. For 1644/2308 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53442 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 43540. Up to 7105 conditions per place. [2023-11-30 03:02:18,168 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 48 selfloop transitions, 2 changer transitions 1/253 dead transitions. [2023-11-30 03:02:18,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 253 transitions, 1024 flow [2023-11-30 03:02:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2023-11-30 03:02:18,171 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2023-11-30 03:02:18,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2023-11-30 03:02:18,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2023-11-30 03:02:18,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:18,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2023-11-30 03:02:18,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:18,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:18,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:18,175 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -88 predicate places. [2023-11-30 03:02:18,175 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 253 transitions, 1024 flow [2023-11-30 03:02:18,176 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:18,176 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:18,176 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] [2023-11-30 03:02:18,176 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:02:18,176 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:18,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash -691476541, now seen corresponding path program 1 times [2023-11-30 03:02:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:18,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350971728] [2023-11-30 03:02:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:18,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:02:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:18,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350971728] [2023-11-30 03:02:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350971728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:18,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483579403] [2023-11-30 03:02:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:18,204 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:18,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:18,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:18,205 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 378 [2023-11-30 03:02:18,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 253 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:18,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:18,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 378 [2023-11-30 03:02:18,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:19,575 INFO L124 PetriNetUnfolderBase]: 4542/8086 cut-off events. [2023-11-30 03:02:19,581 INFO L125 PetriNetUnfolderBase]: For 2012/2842 co-relation queries the response was YES. [2023-11-30 03:02:19,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51281 conditions, 8086 events. 4542/8086 cut-off events. For 2012/2842 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53424 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 50586. Up to 7105 conditions per place. [2023-11-30 03:02:19,776 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 48 selfloop transitions, 2 changer transitions 1/252 dead transitions. [2023-11-30 03:02:19,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 252 transitions, 1122 flow [2023-11-30 03:02:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2023-11-30 03:02:19,778 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2023-11-30 03:02:19,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2023-11-30 03:02:19,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2023-11-30 03:02:19,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:19,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2023-11-30 03:02:19,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:19,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:19,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:19,796 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -87 predicate places. [2023-11-30 03:02:19,796 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 252 transitions, 1122 flow [2023-11-30 03:02:19,797 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:19,797 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:19,797 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] [2023-11-30 03:02:19,797 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:02:19,797 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:19,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1858124862, now seen corresponding path program 1 times [2023-11-30 03:02:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677525411] [2023-11-30 03:02:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:19,908 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:02:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:19,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677525411] [2023-11-30 03:02:19,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677525411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:19,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:19,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762614625] [2023-11-30 03:02:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:19,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:19,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:19,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:19,913 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 378 [2023-11-30 03:02:19,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 252 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:19,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:19,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 378 [2023-11-30 03:02:19,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:21,032 INFO L124 PetriNetUnfolderBase]: 4542/8085 cut-off events. [2023-11-30 03:02:21,032 INFO L125 PetriNetUnfolderBase]: For 2436/3432 co-relation queries the response was YES. [2023-11-30 03:02:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58389 conditions, 8085 events. 4542/8085 cut-off events. For 2436/3432 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53563 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 57632. Up to 7107 conditions per place. [2023-11-30 03:02:21,113 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 50 selfloop transitions, 2 changer transitions 1/251 dead transitions. [2023-11-30 03:02:21,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 251 transitions, 1224 flow [2023-11-30 03:02:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-11-30 03:02:21,115 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6472663139329806 [2023-11-30 03:02:21,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-11-30 03:02:21,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-11-30 03:02:21,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:21,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-11-30 03:02:21,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:21,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:21,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:21,118 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -86 predicate places. [2023-11-30 03:02:21,119 INFO L500 AbstractCegarLoop]: Abstraction has has 269 places, 251 transitions, 1224 flow [2023-11-30 03:02:21,119 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:21,119 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:21,119 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:02:21,119 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:02:21,119 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:21,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1452340920, now seen corresponding path program 1 times [2023-11-30 03:02:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048206296] [2023-11-30 03:02:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:21,145 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:02:21,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048206296] [2023-11-30 03:02:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048206296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:21,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876353896] [2023-11-30 03:02:21,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:21,146 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:21,148 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 378 [2023-11-30 03:02:21,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 251 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:21,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:21,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 378 [2023-11-30 03:02:21,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:22,395 INFO L124 PetriNetUnfolderBase]: 4542/8084 cut-off events. [2023-11-30 03:02:22,397 INFO L125 PetriNetUnfolderBase]: For 2916/4078 co-relation queries the response was YES. [2023-11-30 03:02:22,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65492 conditions, 8084 events. 4542/8084 cut-off events. For 2916/4078 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53436 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 64678. Up to 7107 conditions per place. [2023-11-30 03:02:22,801 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 45 selfloop transitions, 2 changer transitions 1/250 dead transitions. [2023-11-30 03:02:22,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 250 transitions, 1316 flow [2023-11-30 03:02:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2023-11-30 03:02:22,829 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2023-11-30 03:02:22,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 747 transitions. [2023-11-30 03:02:22,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 747 transitions. [2023-11-30 03:02:22,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:22,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 747 transitions. [2023-11-30 03:02:22,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:22,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:22,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:22,836 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -85 predicate places. [2023-11-30 03:02:22,836 INFO L500 AbstractCegarLoop]: Abstraction has has 270 places, 250 transitions, 1316 flow [2023-11-30 03:02:22,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:22,840 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:22,841 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] [2023-11-30 03:02:22,841 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:02:22,841 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:22,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash -186686697, now seen corresponding path program 1 times [2023-11-30 03:02:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:22,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53096527] [2023-11-30 03:02:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:22,890 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:02:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53096527] [2023-11-30 03:02:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53096527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:22,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587487278] [2023-11-30 03:02:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:22,891 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:22,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:22,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:22,892 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 378 [2023-11-30 03:02:22,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 250 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:22,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:22,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 378 [2023-11-30 03:02:22,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:24,039 INFO L124 PetriNetUnfolderBase]: 4542/8083 cut-off events. [2023-11-30 03:02:24,039 INFO L125 PetriNetUnfolderBase]: For 3452/4780 co-relation queries the response was YES. [2023-11-30 03:02:24,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72595 conditions, 8083 events. 4542/8083 cut-off events. For 3452/4780 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53395 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 71724. Up to 7107 conditions per place. [2023-11-30 03:02:24,122 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 45 selfloop transitions, 2 changer transitions 1/249 dead transitions. [2023-11-30 03:02:24,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 249 transitions, 1408 flow [2023-11-30 03:02:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2023-11-30 03:02:24,125 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2023-11-30 03:02:24,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 747 transitions. [2023-11-30 03:02:24,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 747 transitions. [2023-11-30 03:02:24,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:24,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 747 transitions. [2023-11-30 03:02:24,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:24,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:24,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:24,128 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -84 predicate places. [2023-11-30 03:02:24,129 INFO L500 AbstractCegarLoop]: Abstraction has has 271 places, 249 transitions, 1408 flow [2023-11-30 03:02:24,129 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:24,129 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:24,129 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] [2023-11-30 03:02:24,129 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:02:24,129 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:24,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash 775466901, now seen corresponding path program 1 times [2023-11-30 03:02:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688005988] [2023-11-30 03:02:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:24,149 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:02:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688005988] [2023-11-30 03:02:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688005988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:24,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391480466] [2023-11-30 03:02:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:24,150 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:24,151 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 378 [2023-11-30 03:02:24,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 249 transitions, 1408 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:24,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:24,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 378 [2023-11-30 03:02:24,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:25,762 INFO L124 PetriNetUnfolderBase]: 4542/8082 cut-off events. [2023-11-30 03:02:25,762 INFO L125 PetriNetUnfolderBase]: For 4044/5538 co-relation queries the response was YES. [2023-11-30 03:02:25,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79698 conditions, 8082 events. 4542/8082 cut-off events. For 4044/5538 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 53479 event pairs, 4536 based on Foata normal form. 0/8019 useless extension candidates. Maximal degree in co-relation 78770. Up to 7107 conditions per place. [2023-11-30 03:02:25,851 INFO L140 encePairwiseOnDemand]: 375/378 looper letters, 45 selfloop transitions, 2 changer transitions 1/248 dead transitions. [2023-11-30 03:02:25,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 248 transitions, 1500 flow [2023-11-30 03:02:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2023-11-30 03:02:25,854 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2023-11-30 03:02:25,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 747 transitions. [2023-11-30 03:02:25,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 747 transitions. [2023-11-30 03:02:25,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:25,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 747 transitions. [2023-11-30 03:02:25,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:25,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:25,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:25,860 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -83 predicate places. [2023-11-30 03:02:25,860 INFO L500 AbstractCegarLoop]: Abstraction has has 272 places, 248 transitions, 1500 flow [2023-11-30 03:02:25,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:25,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:25,860 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] [2023-11-30 03:02:25,860 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:02:25,860 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:25,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -5896387, now seen corresponding path program 1 times [2023-11-30 03:02:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577460956] [2023-11-30 03:02:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:02:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577460956] [2023-11-30 03:02:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577460956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:25,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:25,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190613937] [2023-11-30 03:02:25,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:25,954 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:25,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:25,956 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 378 [2023-11-30 03:02:25,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 248 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:25,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:25,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 378 [2023-11-30 03:02:25,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:27,272 INFO L124 PetriNetUnfolderBase]: 4798/9726 cut-off events. [2023-11-30 03:02:27,272 INFO L125 PetriNetUnfolderBase]: For 16726/20645 co-relation queries the response was YES. [2023-11-30 03:02:27,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93142 conditions, 9726 events. 4798/9726 cut-off events. For 16726/20645 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 73445 event pairs, 2797 based on Foata normal form. 1/9544 useless extension candidates. Maximal degree in co-relation 92103. Up to 7529 conditions per place. [2023-11-30 03:02:27,547 INFO L140 encePairwiseOnDemand]: 368/378 looper letters, 78 selfloop transitions, 7 changer transitions 4/286 dead transitions. [2023-11-30 03:02:27,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 286 transitions, 2558 flow [2023-11-30 03:02:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2023-11-30 03:02:27,549 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.689594356261023 [2023-11-30 03:02:27,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 782 transitions. [2023-11-30 03:02:27,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 782 transitions. [2023-11-30 03:02:27,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:27,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 782 transitions. [2023-11-30 03:02:27,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:27,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:27,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:27,553 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -83 predicate places. [2023-11-30 03:02:27,553 INFO L500 AbstractCegarLoop]: Abstraction has has 272 places, 286 transitions, 2558 flow [2023-11-30 03:02:27,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:27,553 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:27,553 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] [2023-11-30 03:02:27,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:02:27,553 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:27,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 637282203, now seen corresponding path program 1 times [2023-11-30 03:02:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190626186] [2023-11-30 03:02:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:27,596 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:02:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:27,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190626186] [2023-11-30 03:02:27,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190626186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:27,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:27,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:27,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7562393] [2023-11-30 03:02:27,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:27,598 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:27,599 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 378 [2023-11-30 03:02:27,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 286 transitions, 2558 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:27,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:27,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 378 [2023-11-30 03:02:27,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:30,619 INFO L124 PetriNetUnfolderBase]: 8286/16258 cut-off events. [2023-11-30 03:02:30,620 INFO L125 PetriNetUnfolderBase]: For 25348/29224 co-relation queries the response was YES. [2023-11-30 03:02:30,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173798 conditions, 16258 events. 8286/16258 cut-off events. For 25348/29224 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 133754 event pairs, 1780 based on Foata normal form. 0/16023 useless extension candidates. Maximal degree in co-relation 170448. Up to 13050 conditions per place. [2023-11-30 03:02:30,893 INFO L140 encePairwiseOnDemand]: 372/378 looper letters, 155 selfloop transitions, 9 changer transitions 5/365 dead transitions. [2023-11-30 03:02:30,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 365 transitions, 4833 flow [2023-11-30 03:02:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:02:30,895 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-30 03:02:30,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:02:30,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:02:30,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:30,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:02:30,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:30,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:30,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:30,899 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -82 predicate places. [2023-11-30 03:02:30,899 INFO L500 AbstractCegarLoop]: Abstraction has has 273 places, 365 transitions, 4833 flow [2023-11-30 03:02:30,899 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:30,899 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:30,900 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] [2023-11-30 03:02:30,900 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:02:30,900 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:30,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1755773041, now seen corresponding path program 1 times [2023-11-30 03:02:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359397083] [2023-11-30 03:02:30,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:30,932 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:02:30,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:30,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359397083] [2023-11-30 03:02:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359397083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244825134] [2023-11-30 03:02:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:30,936 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:30,937 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 378 [2023-11-30 03:02:30,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 365 transitions, 4833 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:30,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:30,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 378 [2023-11-30 03:02:30,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:35,535 INFO L124 PetriNetUnfolderBase]: 12680/24888 cut-off events. [2023-11-30 03:02:35,535 INFO L125 PetriNetUnfolderBase]: For 41761/48080 co-relation queries the response was YES. [2023-11-30 03:02:35,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286422 conditions, 24888 events. 12680/24888 cut-off events. For 41761/48080 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 219820 event pairs, 1433 based on Foata normal form. 2/24549 useless extension candidates. Maximal degree in co-relation 278949. Up to 20016 conditions per place. [2023-11-30 03:02:35,991 INFO L140 encePairwiseOnDemand]: 372/378 looper letters, 302 selfloop transitions, 17 changer transitions 6/520 dead transitions. [2023-11-30 03:02:35,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 520 transitions, 9574 flow [2023-11-30 03:02:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:02:35,993 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-30 03:02:35,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:02:35,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:02:35,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:35,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:02:35,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:35,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:35,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:35,996 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -81 predicate places. [2023-11-30 03:02:35,997 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 520 transitions, 9574 flow [2023-11-30 03:02:35,997 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:35,997 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:35,997 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:02:35,997 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:02:35,997 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:35,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:35,997 INFO L85 PathProgramCache]: Analyzing trace with hash 623918884, now seen corresponding path program 1 times [2023-11-30 03:02:35,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:35,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793368619] [2023-11-30 03:02:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:36,026 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:02:36,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:36,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793368619] [2023-11-30 03:02:36,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793368619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:36,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:36,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225144866] [2023-11-30 03:02:36,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:36,028 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:36,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:36,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:36,029 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 378 [2023-11-30 03:02:36,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 520 transitions, 9574 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:36,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:36,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 378 [2023-11-30 03:02:36,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:43,958 INFO L124 PetriNetUnfolderBase]: 18404/35597 cut-off events. [2023-11-30 03:02:43,958 INFO L125 PetriNetUnfolderBase]: For 68638/84557 co-relation queries the response was YES. [2023-11-30 03:02:44,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444911 conditions, 35597 events. 18404/35597 cut-off events. For 68638/84557 co-relation queries the response was YES. Maximal size of possible extension queue 1189. Compared 327305 event pairs, 1327 based on Foata normal form. 16/35138 useless extension candidates. Maximal degree in co-relation 425569. Up to 29107 conditions per place. [2023-11-30 03:02:44,542 INFO L140 encePairwiseOnDemand]: 372/378 looper letters, 573 selfloop transitions, 33 changer transitions 7/807 dead transitions. [2023-11-30 03:02:44,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 807 transitions, 18926 flow [2023-11-30 03:02:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:02:44,544 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-30 03:02:44,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:02:44,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:02:44,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:44,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:02:44,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:44,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:44,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:44,558 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -80 predicate places. [2023-11-30 03:02:44,558 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 807 transitions, 18926 flow [2023-11-30 03:02:44,558 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:44,558 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:44,558 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] [2023-11-30 03:02:44,558 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:02:44,558 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:44,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1713962781, now seen corresponding path program 1 times [2023-11-30 03:02:44,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:44,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467321903] [2023-11-30 03:02:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:44,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:44,582 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:02:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:44,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467321903] [2023-11-30 03:02:44,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467321903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:44,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:44,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078567459] [2023-11-30 03:02:44,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:44,583 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:44,584 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 378 [2023-11-30 03:02:44,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 807 transitions, 18926 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:44,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:44,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 378 [2023-11-30 03:02:44,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:58,711 INFO L124 PetriNetUnfolderBase]: 28255/57846 cut-off events. [2023-11-30 03:02:58,711 INFO L125 PetriNetUnfolderBase]: For 175339/200782 co-relation queries the response was YES. [2023-11-30 03:02:58,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734135 conditions, 57846 events. 28255/57846 cut-off events. For 175339/200782 co-relation queries the response was YES. Maximal size of possible extension queue 1974. Compared 597520 event pairs, 841 based on Foata normal form. 33/56807 useless extension candidates. Maximal degree in co-relation 701967. Up to 44890 conditions per place. [2023-11-30 03:02:59,802 INFO L140 encePairwiseOnDemand]: 368/378 looper letters, 1054 selfloop transitions, 127 changer transitions 11/1385 dead transitions. [2023-11-30 03:02:59,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1385 transitions, 38841 flow [2023-11-30 03:02:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:02:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:02:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:02:59,815 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-30 03:02:59,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:02:59,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:02:59,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:59,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:02:59,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:59,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:59,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:59,819 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -79 predicate places. [2023-11-30 03:02:59,819 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 1385 transitions, 38841 flow [2023-11-30 03:02:59,819 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:59,819 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:59,819 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] [2023-11-30 03:02:59,819 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:02:59,819 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:02:59,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2146013851, now seen corresponding path program 1 times [2023-11-30 03:02:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:59,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031328828] [2023-11-30 03:02:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:59,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:59,865 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:02:59,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:59,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031328828] [2023-11-30 03:02:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031328828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:59,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:02:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489838456] [2023-11-30 03:02:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:59,868 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:02:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:59,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:02:59,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:02:59,869 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 378 [2023-11-30 03:02:59,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1385 transitions, 38841 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:59,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:59,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 378 [2023-11-30 03:02:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:03:29,221 INFO L124 PetriNetUnfolderBase]: 41636/86918 cut-off events. [2023-11-30 03:03:29,221 INFO L125 PetriNetUnfolderBase]: For 327440/383482 co-relation queries the response was YES. [2023-11-30 03:03:29,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154724 conditions, 86918 events. 41636/86918 cut-off events. For 327440/383482 co-relation queries the response was YES. Maximal size of possible extension queue 2918. Compared 959640 event pairs, 812 based on Foata normal form. 192/85342 useless extension candidates. Maximal degree in co-relation 964495. Up to 66496 conditions per place. [2023-11-30 03:03:30,989 INFO L140 encePairwiseOnDemand]: 368/378 looper letters, 2052 selfloop transitions, 236 changer transitions 19/2499 dead transitions. [2023-11-30 03:03:30,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 2499 transitions, 79461 flow [2023-11-30 03:03:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:03:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:03:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:03:30,991 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-30 03:03:30,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:03:30,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:03:30,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:03:30,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:03:30,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:30,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:30,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:30,994 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -78 predicate places. [2023-11-30 03:03:30,994 INFO L500 AbstractCegarLoop]: Abstraction has has 277 places, 2499 transitions, 79461 flow [2023-11-30 03:03:30,994 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:30,994 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:03:30,994 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] [2023-11-30 03:03:30,994 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:03:30,994 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:03:30,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:03:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 733842920, now seen corresponding path program 1 times [2023-11-30 03:03:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:03:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254881892] [2023-11-30 03:03:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:03:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:03:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:03:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:03:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:03:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254881892] [2023-11-30 03:03:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254881892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:03:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:03:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:03:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672565472] [2023-11-30 03:03:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:03:31,029 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:03:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:03:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:03:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:03:31,030 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 378 [2023-11-30 03:03:31,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 2499 transitions, 79461 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:03:31,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:03:31,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 378 [2023-11-30 03:03:31,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:48,712 INFO L124 PetriNetUnfolderBase]: 61300/126750 cut-off events. [2023-11-30 03:04:48,713 INFO L125 PetriNetUnfolderBase]: For 541332/604947 co-relation queries the response was YES. [2023-11-30 03:04:49,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799725 conditions, 126750 events. 61300/126750 cut-off events. For 541332/604947 co-relation queries the response was YES. Maximal size of possible extension queue 4179. Compared 1449316 event pairs, 541 based on Foata normal form. 459/124844 useless extension candidates. Maximal degree in co-relation 1722239. Up to 98058 conditions per place. [2023-11-30 03:04:51,782 INFO L140 encePairwiseOnDemand]: 368/378 looper letters, 3850 selfloop transitions, 478 changer transitions 31/4550 dead transitions. [2023-11-30 03:04:51,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 4550 transitions, 158489 flow [2023-11-30 03:04:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-11-30 03:04:51,784 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2023-11-30 03:04:51,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-11-30 03:04:51,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-11-30 03:04:51,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:51,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-11-30 03:04:51,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:51,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:51,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:51,792 INFO L307 CegarLoopForPetriNet]: 355 programPoint places, -77 predicate places. [2023-11-30 03:04:51,792 INFO L500 AbstractCegarLoop]: Abstraction has has 278 places, 4550 transitions, 158489 flow [2023-11-30 03:04:51,792 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:51,792 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:51,793 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:51,793 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:04:51,793 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 206 more)] === [2023-11-30 03:04:51,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1264237921, now seen corresponding path program 1 times [2023-11-30 03:04:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:51,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283120935] [2023-11-30 03:04:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:04:52,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:52,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283120935] [2023-11-30 03:04:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283120935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:52,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:04:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402678204] [2023-11-30 03:04:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:52,663 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:04:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:52,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:04:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:04:52,664 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 378 [2023-11-30 03:04:52,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 4550 transitions, 158489 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:52,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:52,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 378 [2023-11-30 03:04:52,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 03:14:27,863 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:14:28,871 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 [2023-11-30 03:14:29,539 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (209 of 210 remaining) [2023-11-30 03:14:29,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:14:29,539 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-30 03:14:29,540 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (208 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (207 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (206 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (205 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (204 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (203 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (202 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (201 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (200 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (199 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (198 of 210 remaining) [2023-11-30 03:14:29,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (197 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (196 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (195 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (194 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (193 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (192 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (191 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (190 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (189 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (188 of 210 remaining) [2023-11-30 03:14:29,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (187 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (186 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err23ASSERT_VIOLATIONDATA_RACE (185 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err24ASSERT_VIOLATIONDATA_RACE (184 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err25ASSERT_VIOLATIONDATA_RACE (183 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err26ASSERT_VIOLATIONDATA_RACE (182 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err27ASSERT_VIOLATIONDATA_RACE (181 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err28ASSERT_VIOLATIONDATA_RACE (180 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err29ASSERT_VIOLATIONDATA_RACE (179 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err30ASSERT_VIOLATIONDATA_RACE (178 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (177 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (176 of 210 remaining) [2023-11-30 03:14:29,543 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (175 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (174 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (173 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (172 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (171 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (170 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (169 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (168 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (167 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (166 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (165 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (164 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (163 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (162 of 210 remaining) [2023-11-30 03:14:29,544 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (161 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (160 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (159 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (158 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (157 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (156 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (155 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (154 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (153 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err25ASSERT_VIOLATIONDATA_RACE (152 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err26ASSERT_VIOLATIONDATA_RACE (151 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err27ASSERT_VIOLATIONDATA_RACE (150 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err28ASSERT_VIOLATIONDATA_RACE (149 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err29ASSERT_VIOLATIONDATA_RACE (148 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err30ASSERT_VIOLATIONDATA_RACE (147 of 210 remaining) [2023-11-30 03:14:29,545 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (146 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (145 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (144 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (143 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (142 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (141 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (139 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (138 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (137 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (136 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (135 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (134 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (133 of 210 remaining) [2023-11-30 03:14:29,546 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err14ASSERT_VIOLATIONDATA_RACE (132 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err15ASSERT_VIOLATIONDATA_RACE (131 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err16ASSERT_VIOLATIONDATA_RACE (130 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err17ASSERT_VIOLATIONDATA_RACE (129 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err18ASSERT_VIOLATIONDATA_RACE (128 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err19ASSERT_VIOLATIONDATA_RACE (127 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err20ASSERT_VIOLATIONDATA_RACE (126 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err21ASSERT_VIOLATIONDATA_RACE (125 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err22ASSERT_VIOLATIONDATA_RACE (124 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err23ASSERT_VIOLATIONDATA_RACE (123 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err24ASSERT_VIOLATIONDATA_RACE (122 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err25ASSERT_VIOLATIONDATA_RACE (121 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err26ASSERT_VIOLATIONDATA_RACE (120 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err27ASSERT_VIOLATIONDATA_RACE (119 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err28ASSERT_VIOLATIONDATA_RACE (118 of 210 remaining) [2023-11-30 03:14:29,547 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err29ASSERT_VIOLATIONDATA_RACE (117 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err30ASSERT_VIOLATIONDATA_RACE (116 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (115 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (114 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (113 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (112 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (111 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (110 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (109 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (108 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (107 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (106 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (105 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (104 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (103 of 210 remaining) [2023-11-30 03:14:29,548 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (102 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (101 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (100 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (99 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (98 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (97 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (96 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (95 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (94 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (92 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (91 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (90 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (89 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (88 of 210 remaining) [2023-11-30 03:14:29,549 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (86 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (85 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (84 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (83 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (81 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (80 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (79 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (78 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (77 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (76 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (75 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (74 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (73 of 210 remaining) [2023-11-30 03:14:29,550 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (72 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (71 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (70 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err23ASSERT_VIOLATIONDATA_RACE (69 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err24ASSERT_VIOLATIONDATA_RACE (68 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err25ASSERT_VIOLATIONDATA_RACE (67 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err26ASSERT_VIOLATIONDATA_RACE (66 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err27ASSERT_VIOLATIONDATA_RACE (65 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err29ASSERT_VIOLATIONDATA_RACE (63 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err30ASSERT_VIOLATIONDATA_RACE (62 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 210 remaining) [2023-11-30 03:14:29,551 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (53 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (51 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (50 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (49 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (48 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (47 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (46 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (45 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (44 of 210 remaining) [2023-11-30 03:14:29,552 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (43 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (42 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (41 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (40 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (39 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (38 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (37 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err25ASSERT_VIOLATIONDATA_RACE (36 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err26ASSERT_VIOLATIONDATA_RACE (35 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err27ASSERT_VIOLATIONDATA_RACE (34 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err28ASSERT_VIOLATIONDATA_RACE (33 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err29ASSERT_VIOLATIONDATA_RACE (32 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err30ASSERT_VIOLATIONDATA_RACE (31 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (30 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (29 of 210 remaining) [2023-11-30 03:14:29,553 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (28 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (27 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (25 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (24 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (23 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (22 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (21 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (20 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (19 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (18 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (17 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err14ASSERT_VIOLATIONDATA_RACE (16 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 210 remaining) [2023-11-30 03:14:29,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err16ASSERT_VIOLATIONDATA_RACE (14 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err17ASSERT_VIOLATIONDATA_RACE (13 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err18ASSERT_VIOLATIONDATA_RACE (12 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err19ASSERT_VIOLATIONDATA_RACE (11 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err20ASSERT_VIOLATIONDATA_RACE (10 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err21ASSERT_VIOLATIONDATA_RACE (9 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err22ASSERT_VIOLATIONDATA_RACE (8 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err23ASSERT_VIOLATIONDATA_RACE (7 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err24ASSERT_VIOLATIONDATA_RACE (6 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err25ASSERT_VIOLATIONDATA_RACE (5 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err26ASSERT_VIOLATIONDATA_RACE (4 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err27ASSERT_VIOLATIONDATA_RACE (3 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err28ASSERT_VIOLATIONDATA_RACE (2 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err29ASSERT_VIOLATIONDATA_RACE (1 of 210 remaining) [2023-11-30 03:14:29,555 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err30ASSERT_VIOLATIONDATA_RACE (0 of 210 remaining) [2023-11-30 03:14:29,556 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:14:29,561 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:14:29,561 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:14:29,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:14:29 BasicIcfg [2023-11-30 03:14:29,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:14:29,565 INFO L158 Benchmark]: Toolchain (without parser) took 739396.58ms. Allocated memory was 660.6MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 613.7MB in the beginning and 6.8GB in the end (delta: -6.2GB). Peak memory consumption was 9.6GB. Max. memory is 16.0GB. [2023-11-30 03:14:29,565 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory is still 311.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:14:29,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.36ms. Allocated memory is still 660.6MB. Free memory was 613.5MB in the beginning and 599.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 03:14:29,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.02ms. Allocated memory is still 660.6MB. Free memory was 599.4MB in the beginning and 595.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:14:29,565 INFO L158 Benchmark]: Boogie Preprocessor took 26.68ms. Allocated memory is still 660.6MB. Free memory was 595.6MB in the beginning and 592.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:14:29,565 INFO L158 Benchmark]: RCFGBuilder took 929.34ms. Allocated memory is still 660.6MB. Free memory was 592.8MB in the beginning and 534.6MB in the end (delta: 58.2MB). Peak memory consumption was 60.1MB. Max. memory is 16.0GB. [2023-11-30 03:14:29,566 INFO L158 Benchmark]: TraceAbstraction took 738168.26ms. Allocated memory was 660.6MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 534.6MB in the beginning and 6.8GB in the end (delta: -6.2GB). Peak memory consumption was 9.5GB. Max. memory is 16.0GB. [2023-11-30 03:14:29,566 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 362.8MB. Free memory is still 311.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 228.36ms. Allocated memory is still 660.6MB. Free memory was 613.5MB in the beginning and 599.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.02ms. Allocated memory is still 660.6MB. Free memory was 599.4MB in the beginning and 595.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.68ms. Allocated memory is still 660.6MB. Free memory was 595.6MB in the beginning and 592.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 929.34ms. Allocated memory is still 660.6MB. Free memory was 592.8MB in the beginning and 534.6MB in the end (delta: 58.2MB). Peak memory consumption was 60.1MB. Max. memory is 16.0GB. * TraceAbstraction took 738168.26ms. Allocated memory was 660.6MB in the beginning and 15.9GB in the end (delta: 15.3GB). Free memory was 534.6MB in the beginning and 6.8GB in the end (delta: -6.2GB). Peak memory consumption was 9.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 191]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 151]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 174]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 175]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 180]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 181]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 182]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 183]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 186]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 192]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 193]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 195]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 190]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 189]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 188]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 515 locations, 210 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: 738.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 736.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 410 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 90 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158489occurred in iteration=17, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1505 NumberOfCodeBlocks, 1505 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1487 ConstructedInterpolants, 0 QuantifiedInterpolants, 1602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown