/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-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:04:43,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:04:43,734 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:04:43,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:04:43,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:04:43,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:04:43,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:04:43,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:04:43,761 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:04:43,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:04:43,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:04:43,764 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:04:43,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:04:43,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:04:43,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:04:43,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:04:43,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:04:43,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:04:43,766 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:04:43,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:04:43,767 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:04:43,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:04:43,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:04:43,768 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:04:43,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:04:43,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:04:43,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:04:43,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:04:43,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:04:43,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:04:43,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:04:43,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:04:43,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:04:43,771 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:04:43,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:04:43,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:04:43,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:04:43,971 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:04:43,972 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:04:43,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-11-30 03:04:44,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:04:45,084 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:04:45,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-11-30 03:04:45,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd847139e/590226b59a6b4975992f88758783d959/FLAGbc6b2a54e [2023-11-30 03:04:45,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd847139e/590226b59a6b4975992f88758783d959 [2023-11-30 03:04:45,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:04:45,103 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:04:45,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:04:45,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:04:45,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:04:45,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3593fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45, skipping insertion in model container [2023-11-30 03:04:45,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,121 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:04:45,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:04:45,302 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:04:45,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:04:45,339 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:04:45,340 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:04:45,344 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:04:45,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45 WrapperNode [2023-11-30 03:04:45,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:04:45,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:04:45,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:04:45,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:04:45,349 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:04:45" (1/1) ... [2023-11-30 03:04:45,356 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:04:45" (1/1) ... [2023-11-30 03:04:45,371 INFO L138 Inliner]: procedures = 25, calls = 54, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2023-11-30 03:04:45,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:04:45,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:04:45,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:04:45,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:04:45,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:04:45,397 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:04:45,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:04:45,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:04:45,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (1/1) ... [2023-11-30 03:04:45,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:04:45,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:04:45,453 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:04:45,469 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:04:45,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:04:45,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:04:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:04:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:04:45,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:04:45,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:04:45,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:04:45,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:04:45,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:04:45,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:04:45,509 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:04:45,606 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:04:45,608 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:04:46,033 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:04:46,259 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:04:46,260 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 03:04:46,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:04:46 BoogieIcfgContainer [2023-11-30 03:04:46,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:04:46,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:04:46,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:04:46,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:04:46,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:04:45" (1/3) ... [2023-11-30 03:04:46,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546af0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:04:46, skipping insertion in model container [2023-11-30 03:04:46,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:04:45" (2/3) ... [2023-11-30 03:04:46,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546af0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:04:46, skipping insertion in model container [2023-11-30 03:04:46,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:04:46" (3/3) ... [2023-11-30 03:04:46,268 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2023-11-30 03:04:46,281 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:04:46,282 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-11-30 03:04:46,282 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:04:46,357 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 03:04:46,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 333 places, 338 transitions, 697 flow [2023-11-30 03:04:46,497 INFO L124 PetriNetUnfolderBase]: 15/335 cut-off events. [2023-11-30 03:04:46,498 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 03:04:46,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 335 events. 15/335 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 500 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-11-30 03:04:46,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 338 transitions, 697 flow [2023-11-30 03:04:46,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 308 places, 312 transitions, 642 flow [2023-11-30 03:04:46,527 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:04:46,532 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;@2154ff35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:04:46,532 INFO L363 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-30 03:04:46,537 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:04:46,537 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 03:04:46,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:04:46,537 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:46,538 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] [2023-11-30 03:04:46,538 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:46,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash -248387533, now seen corresponding path program 1 times [2023-11-30 03:04:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435611502] [2023-11-30 03:04:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:46,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:46,727 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:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435611502] [2023-11-30 03:04:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435611502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605402085] [2023-11-30 03:04:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:46,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:46,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:46,764 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 338 [2023-11-30 03:04:46,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 312 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call 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:46,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:46,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 338 [2023-11-30 03:04:46,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:46,933 INFO L124 PetriNetUnfolderBase]: 95/618 cut-off events. [2023-11-30 03:04:46,933 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-30 03:04:46,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 618 events. 95/618 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2530 event pairs, 71 based on Foata normal form. 32/561 useless extension candidates. Maximal degree in co-relation 535. Up to 144 conditions per place. [2023-11-30 03:04:46,939 INFO L140 encePairwiseOnDemand]: 301/338 looper letters, 22 selfloop transitions, 2 changer transitions 4/277 dead transitions. [2023-11-30 03:04:46,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 277 transitions, 620 flow [2023-11-30 03:04:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2023-11-30 03:04:46,954 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8747534516765286 [2023-11-30 03:04:46,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2023-11-30 03:04:46,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2023-11-30 03:04:46,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:46,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2023-11-30 03:04:46,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:46,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:46,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:46,971 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -26 predicate places. [2023-11-30 03:04:46,971 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 277 transitions, 620 flow [2023-11-30 03:04:46,972 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call 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:46,972 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:46,972 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] [2023-11-30 03:04:46,973 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:04:46,973 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:46,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash 5808112, now seen corresponding path program 1 times [2023-11-30 03:04:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111994875] [2023-11-30 03:04:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:47,046 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:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111994875] [2023-11-30 03:04:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111994875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:47,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699300317] [2023-11-30 03:04:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:47,049 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:47,072 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 338 [2023-11-30 03:04:47,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 277 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:47,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 338 [2023-11-30 03:04:47,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:47,162 INFO L124 PetriNetUnfolderBase]: 95/617 cut-off events. [2023-11-30 03:04:47,162 INFO L125 PetriNetUnfolderBase]: For 133/221 co-relation queries the response was YES. [2023-11-30 03:04:47,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 617 events. 95/617 cut-off events. For 133/221 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2535 event pairs, 71 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 657. Up to 144 conditions per place. [2023-11-30 03:04:47,166 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 19 selfloop transitions, 2 changer transitions 4/276 dead transitions. [2023-11-30 03:04:47,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 276 transitions, 660 flow [2023-11-30 03:04:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-11-30 03:04:47,168 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8471400394477318 [2023-11-30 03:04:47,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:47,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call 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:47,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,172 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -25 predicate places. [2023-11-30 03:04:47,172 INFO L500 AbstractCegarLoop]: Abstraction has has 283 places, 276 transitions, 660 flow [2023-11-30 03:04:47,173 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,173 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:47,173 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:04:47,173 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:04:47,174 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:47,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 36295275, now seen corresponding path program 1 times [2023-11-30 03:04:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345202874] [2023-11-30 03:04:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:47,237 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:47,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:47,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345202874] [2023-11-30 03:04:47,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345202874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:47,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:47,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885038877] [2023-11-30 03:04:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:47,240 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:47,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:47,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:47,244 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 338 [2023-11-30 03:04:47,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 276 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call 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:47,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:47,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 338 [2023-11-30 03:04:47,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:47,376 INFO L124 PetriNetUnfolderBase]: 263/907 cut-off events. [2023-11-30 03:04:47,376 INFO L125 PetriNetUnfolderBase]: For 717/897 co-relation queries the response was YES. [2023-11-30 03:04:47,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 907 events. 263/907 cut-off events. For 717/897 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4774 event pairs, 230 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1658. Up to 411 conditions per place. [2023-11-30 03:04:47,383 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 28 selfloop transitions, 2 changer transitions 4/275 dead transitions. [2023-11-30 03:04:47,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 275 transitions, 718 flow [2023-11-30 03:04:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2023-11-30 03:04:47,385 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8293885601577909 [2023-11-30 03:04:47,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 841 transitions. [2023-11-30 03:04:47,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 841 transitions. [2023-11-30 03:04:47,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:47,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 841 transitions. [2023-11-30 03:04:47,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,390 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -24 predicate places. [2023-11-30 03:04:47,390 INFO L500 AbstractCegarLoop]: Abstraction has has 284 places, 275 transitions, 718 flow [2023-11-30 03:04:47,391 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call 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:47,391 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:47,391 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] [2023-11-30 03:04:47,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:04:47,392 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:47,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1547552004, now seen corresponding path program 1 times [2023-11-30 03:04:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606749001] [2023-11-30 03:04:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:47,451 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:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:47,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606749001] [2023-11-30 03:04:47,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606749001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:47,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791624754] [2023-11-30 03:04:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:47,452 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:47,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:47,453 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 338 [2023-11-30 03:04:47,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 275 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call 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:47,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:47,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 338 [2023-11-30 03:04:47,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:47,579 INFO L124 PetriNetUnfolderBase]: 197/773 cut-off events. [2023-11-30 03:04:47,579 INFO L125 PetriNetUnfolderBase]: For 757/1051 co-relation queries the response was YES. [2023-11-30 03:04:47,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 773 events. 197/773 cut-off events. For 757/1051 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3760 event pairs, 167 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1583. Up to 304 conditions per place. [2023-11-30 03:04:47,584 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 22 selfloop transitions, 1 changer transitions 4/271 dead transitions. [2023-11-30 03:04:47,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 271 transitions, 748 flow [2023-11-30 03:04:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2023-11-30 03:04:47,586 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8372781065088757 [2023-11-30 03:04:47,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2023-11-30 03:04:47,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2023-11-30 03:04:47,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:47,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2023-11-30 03:04:47,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call 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:47,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,590 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -26 predicate places. [2023-11-30 03:04:47,591 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 271 transitions, 748 flow [2023-11-30 03:04:47,591 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call 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:47,591 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:47,591 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:47,591 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:04:47,591 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:47,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 362901366, now seen corresponding path program 1 times [2023-11-30 03:04:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759484021] [2023-11-30 03:04:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:47,618 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:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759484021] [2023-11-30 03:04:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759484021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:47,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:47,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138130762] [2023-11-30 03:04:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:47,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:47,621 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 338 [2023-11-30 03:04:47,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 271 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:47,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 338 [2023-11-30 03:04:47,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:47,712 INFO L124 PetriNetUnfolderBase]: 197/772 cut-off events. [2023-11-30 03:04:47,712 INFO L125 PetriNetUnfolderBase]: For 1213/1597 co-relation queries the response was YES. [2023-11-30 03:04:47,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 772 events. 197/772 cut-off events. For 1213/1597 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3752 event pairs, 167 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1787. Up to 304 conditions per place. [2023-11-30 03:04:47,717 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 19 selfloop transitions, 2 changer transitions 4/270 dead transitions. [2023-11-30 03:04:47,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 270 transitions, 788 flow [2023-11-30 03:04:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-11-30 03:04:47,719 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8471400394477318 [2023-11-30 03:04:47,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:47,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call 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:47,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,723 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -25 predicate places. [2023-11-30 03:04:47,723 INFO L500 AbstractCegarLoop]: Abstraction has has 283 places, 270 transitions, 788 flow [2023-11-30 03:04:47,724 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,724 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:47,724 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] [2023-11-30 03:04:47,724 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:04:47,724 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:47,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash 824035336, now seen corresponding path program 1 times [2023-11-30 03:04:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537141738] [2023-11-30 03:04:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:47,749 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:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537141738] [2023-11-30 03:04:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537141738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:47,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648851388] [2023-11-30 03:04:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:47,750 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:47,751 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 338 [2023-11-30 03:04:47,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 270 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:47,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 338 [2023-11-30 03:04:47,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:47,851 INFO L124 PetriNetUnfolderBase]: 197/771 cut-off events. [2023-11-30 03:04:47,851 INFO L125 PetriNetUnfolderBase]: For 1780/2238 co-relation queries the response was YES. [2023-11-30 03:04:47,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 771 events. 197/771 cut-off events. For 1780/2238 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3724 event pairs, 167 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 1991. Up to 304 conditions per place. [2023-11-30 03:04:47,858 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 19 selfloop transitions, 2 changer transitions 4/269 dead transitions. [2023-11-30 03:04:47,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 269 transitions, 828 flow [2023-11-30 03:04:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-11-30 03:04:47,860 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8471400394477318 [2023-11-30 03:04:47,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:47,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-11-30 03:04:47,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call 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:47,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:47,865 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -24 predicate places. [2023-11-30 03:04:47,865 INFO L500 AbstractCegarLoop]: Abstraction has has 284 places, 269 transitions, 828 flow [2023-11-30 03:04:47,866 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:47,866 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:47,866 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] [2023-11-30 03:04:47,866 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:04:47,866 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:47,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2057379378, now seen corresponding path program 1 times [2023-11-30 03:04:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467066025] [2023-11-30 03:04:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:47,895 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:47,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467066025] [2023-11-30 03:04:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467066025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:47,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280737476] [2023-11-30 03:04:47,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:47,896 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:47,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:47,897 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 338 [2023-11-30 03:04:47,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 269 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call 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:47,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:47,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 338 [2023-11-30 03:04:47,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:48,006 INFO L124 PetriNetUnfolderBase]: 197/770 cut-off events. [2023-11-30 03:04:48,006 INFO L125 PetriNetUnfolderBase]: For 2458/2990 co-relation queries the response was YES. [2023-11-30 03:04:48,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 770 events. 197/770 cut-off events. For 2458/2990 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3729 event pairs, 167 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 2195. Up to 304 conditions per place. [2023-11-30 03:04:48,013 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 27 selfloop transitions, 2 changer transitions 4/268 dead transitions. [2023-11-30 03:04:48,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 268 transitions, 884 flow [2023-11-30 03:04:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2023-11-30 03:04:48,015 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8284023668639053 [2023-11-30 03:04:48,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 840 transitions. [2023-11-30 03:04:48,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 840 transitions. [2023-11-30 03:04:48,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:48,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 840 transitions. [2023-11-30 03:04:48,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call 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:48,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:48,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:48,018 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -23 predicate places. [2023-11-30 03:04:48,018 INFO L500 AbstractCegarLoop]: Abstraction has has 285 places, 268 transitions, 884 flow [2023-11-30 03:04:48,019 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call 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:48,019 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:48,019 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] [2023-11-30 03:04:48,019 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:04:48,019 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:48,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash 867506530, now seen corresponding path program 1 times [2023-11-30 03:04:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665431610] [2023-11-30 03:04:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:48,389 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:48,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665431610] [2023-11-30 03:04:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665431610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:48,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:04:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736671208] [2023-11-30 03:04:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:48,391 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:04:48,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:48,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:04:48,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:04:48,392 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 338 [2023-11-30 03:04:48,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 268 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call 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:48,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:48,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 338 [2023-11-30 03:04:48,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:48,830 INFO L124 PetriNetUnfolderBase]: 1092/2278 cut-off events. [2023-11-30 03:04:48,830 INFO L125 PetriNetUnfolderBase]: For 27616/28976 co-relation queries the response was YES. [2023-11-30 03:04:48,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11905 conditions, 2278 events. 1092/2278 cut-off events. For 27616/28976 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14031 event pairs, 1055 based on Foata normal form. 0/1914 useless extension candidates. Maximal degree in co-relation 11366. Up to 1537 conditions per place. [2023-11-30 03:04:48,877 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 50 selfloop transitions, 5 changer transitions 4/267 dead transitions. [2023-11-30 03:04:48,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 267 transitions, 992 flow [2023-11-30 03:04:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:04:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:04:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1532 transitions. [2023-11-30 03:04:48,880 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7554240631163708 [2023-11-30 03:04:48,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1532 transitions. [2023-11-30 03:04:48,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1532 transitions. [2023-11-30 03:04:48,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:48,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1532 transitions. [2023-11-30 03:04:48,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call 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:48,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:48,885 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:48,886 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -19 predicate places. [2023-11-30 03:04:48,886 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 267 transitions, 992 flow [2023-11-30 03:04:48,887 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call 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:48,887 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:48,887 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] [2023-11-30 03:04:48,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:04:48,887 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:48,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash 343326447, now seen corresponding path program 1 times [2023-11-30 03:04:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:48,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613084776] [2023-11-30 03:04:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:48,911 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:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:48,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613084776] [2023-11-30 03:04:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613084776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:48,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:48,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444305667] [2023-11-30 03:04:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:48,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:48,914 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 338 [2023-11-30 03:04:48,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 267 transitions, 992 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:48,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:48,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 338 [2023-11-30 03:04:48,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:49,375 INFO L124 PetriNetUnfolderBase]: 1092/2277 cut-off events. [2023-11-30 03:04:49,376 INFO L125 PetriNetUnfolderBase]: For 35336/36791 co-relation queries the response was YES. [2023-11-30 03:04:49,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13003 conditions, 2277 events. 1092/2277 cut-off events. For 35336/36791 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14103 event pairs, 1055 based on Foata normal form. 0/1914 useless extension candidates. Maximal degree in co-relation 12436. Up to 1537 conditions per place. [2023-11-30 03:04:49,402 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 19 selfloop transitions, 2 changer transitions 4/266 dead transitions. [2023-11-30 03:04:49,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 266 transitions, 1032 flow [2023-11-30 03:04:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-11-30 03:04:49,405 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8471400394477318 [2023-11-30 03:04:49,405 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-11-30 03:04:49,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-11-30 03:04:49,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:49,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-11-30 03:04:49,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call 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:49,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:49,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:49,409 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -18 predicate places. [2023-11-30 03:04:49,409 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 266 transitions, 1032 flow [2023-11-30 03:04:49,409 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call 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:49,409 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:49,410 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] [2023-11-30 03:04:49,410 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:04:49,410 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:49,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1838441005, now seen corresponding path program 1 times [2023-11-30 03:04:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:49,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501677070] [2023-11-30 03:04:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:04:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:49,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501677070] [2023-11-30 03:04:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501677070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:49,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971412305] [2023-11-30 03:04:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:49,437 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:49,439 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 338 [2023-11-30 03:04:49,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 266 transitions, 1032 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call 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:49,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:49,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 338 [2023-11-30 03:04:49,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:49,841 INFO L124 PetriNetUnfolderBase]: 1142/2376 cut-off events. [2023-11-30 03:04:49,841 INFO L125 PetriNetUnfolderBase]: For 50793/52800 co-relation queries the response was YES. [2023-11-30 03:04:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14761 conditions, 2376 events. 1142/2376 cut-off events. For 50793/52800 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14978 event pairs, 482 based on Foata normal form. 0/1970 useless extension candidates. Maximal degree in co-relation 14171. Up to 1580 conditions per place. [2023-11-30 03:04:49,871 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 23 selfloop transitions, 2 changer transitions 4/270 dead transitions. [2023-11-30 03:04:49,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 270 transitions, 1200 flow [2023-11-30 03:04:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2023-11-30 03:04:49,873 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8550295857988166 [2023-11-30 03:04:49,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 867 transitions. [2023-11-30 03:04:49,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 867 transitions. [2023-11-30 03:04:49,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:49,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 867 transitions. [2023-11-30 03:04:49,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 289.0) internal successors, (867), 3 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call 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:49,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:49,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:49,878 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -18 predicate places. [2023-11-30 03:04:49,878 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 270 transitions, 1200 flow [2023-11-30 03:04:49,878 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call 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:49,878 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:49,878 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:49,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:04:49,879 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:49,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1510273350, now seen corresponding path program 1 times [2023-11-30 03:04:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110831747] [2023-11-30 03:04:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:04:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110831747] [2023-11-30 03:04:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110831747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:49,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:49,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998571277] [2023-11-30 03:04:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:49,905 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:49,906 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 338 [2023-11-30 03:04:49,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 270 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:49,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:49,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 338 [2023-11-30 03:04:49,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:50,280 INFO L124 PetriNetUnfolderBase]: 1159/2370 cut-off events. [2023-11-30 03:04:50,280 INFO L125 PetriNetUnfolderBase]: For 57593/59378 co-relation queries the response was YES. [2023-11-30 03:04:50,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15965 conditions, 2370 events. 1159/2370 cut-off events. For 57593/59378 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14423 event pairs, 475 based on Foata normal form. 1/1948 useless extension candidates. Maximal degree in co-relation 14007. Up to 1582 conditions per place. [2023-11-30 03:04:50,303 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 28 selfloop transitions, 3 changer transitions 4/277 dead transitions. [2023-11-30 03:04:50,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 277 transitions, 1443 flow [2023-11-30 03:04:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2023-11-30 03:04:50,305 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8609467455621301 [2023-11-30 03:04:50,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 873 transitions. [2023-11-30 03:04:50,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 873 transitions. [2023-11-30 03:04:50,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:50,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 873 transitions. [2023-11-30 03:04:50,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call 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:50,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:50,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:50,308 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -17 predicate places. [2023-11-30 03:04:50,308 INFO L500 AbstractCegarLoop]: Abstraction has has 291 places, 277 transitions, 1443 flow [2023-11-30 03:04:50,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:50,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:50,309 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:50,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:04:50,309 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:50,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1028396081, now seen corresponding path program 1 times [2023-11-30 03:04:50,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:50,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737338366] [2023-11-30 03:04:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:50,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:50,330 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:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737338366] [2023-11-30 03:04:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737338366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035866287] [2023-11-30 03:04:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:50,331 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:50,332 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 338 [2023-11-30 03:04:50,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 277 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:50,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:50,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 338 [2023-11-30 03:04:50,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:50,733 INFO L124 PetriNetUnfolderBase]: 1199/2489 cut-off events. [2023-11-30 03:04:50,733 INFO L125 PetriNetUnfolderBase]: For 69976/72068 co-relation queries the response was YES. [2023-11-30 03:04:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17776 conditions, 2489 events. 1199/2489 cut-off events. For 69976/72068 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 15259 event pairs, 470 based on Foata normal form. 8/2071 useless extension candidates. Maximal degree in co-relation 16476. Up to 1636 conditions per place. [2023-11-30 03:04:50,763 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 34 selfloop transitions, 3 changer transitions 4/282 dead transitions. [2023-11-30 03:04:50,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 282 transitions, 1666 flow [2023-11-30 03:04:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2023-11-30 03:04:50,765 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8609467455621301 [2023-11-30 03:04:50,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 873 transitions. [2023-11-30 03:04:50,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 873 transitions. [2023-11-30 03:04:50,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:50,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 873 transitions. [2023-11-30 03:04:50,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call 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:50,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:50,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:50,769 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -16 predicate places. [2023-11-30 03:04:50,769 INFO L500 AbstractCegarLoop]: Abstraction has has 292 places, 282 transitions, 1666 flow [2023-11-30 03:04:50,769 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:50,769 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:50,769 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:50,769 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:04:50,769 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:50,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1024524668, now seen corresponding path program 1 times [2023-11-30 03:04:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:50,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102768868] [2023-11-30 03:04:50,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:50,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:50,794 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:50,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102768868] [2023-11-30 03:04:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102768868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:50,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:50,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:50,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282943215] [2023-11-30 03:04:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:50,795 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:50,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:50,796 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 338 [2023-11-30 03:04:50,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 282 transitions, 1666 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call 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:50,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:50,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 338 [2023-11-30 03:04:50,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:51,450 INFO L124 PetriNetUnfolderBase]: 1813/3905 cut-off events. [2023-11-30 03:04:51,450 INFO L125 PetriNetUnfolderBase]: For 111701/114008 co-relation queries the response was YES. [2023-11-30 03:04:51,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28361 conditions, 3905 events. 1813/3905 cut-off events. For 111701/114008 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 26086 event pairs, 813 based on Foata normal form. 5/3485 useless extension candidates. Maximal degree in co-relation 14578. Up to 2454 conditions per place. [2023-11-30 03:04:51,489 INFO L140 encePairwiseOnDemand]: 331/338 looper letters, 66 selfloop transitions, 6 changer transitions 8/310 dead transitions. [2023-11-30 03:04:51,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 310 transitions, 2669 flow [2023-11-30 03:04:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2023-11-30 03:04:51,491 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8481262327416174 [2023-11-30 03:04:51,491 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 860 transitions. [2023-11-30 03:04:51,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 860 transitions. [2023-11-30 03:04:51,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:51,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 860 transitions. [2023-11-30 03:04:51,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call 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,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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,495 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -18 predicate places. [2023-11-30 03:04:51,495 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 310 transitions, 2669 flow [2023-11-30 03:04:51,496 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call 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,496 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:51,496 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] [2023-11-30 03:04:51,496 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:04:51,496 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:51,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1020664772, now seen corresponding path program 1 times [2023-11-30 03:04:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606686288] [2023-11-30 03:04:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:51,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:51,517 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:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606686288] [2023-11-30 03:04:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606686288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052116120] [2023-11-30 03:04:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:51,518 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:51,519 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 338 [2023-11-30 03:04:51,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 310 transitions, 2669 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:51,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:51,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 338 [2023-11-30 03:04:51,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:52,184 INFO L124 PetriNetUnfolderBase]: 2094/4507 cut-off events. [2023-11-30 03:04:52,184 INFO L125 PetriNetUnfolderBase]: For 143509/147448 co-relation queries the response was YES. [2023-11-30 03:04:52,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34385 conditions, 4507 events. 2094/4507 cut-off events. For 143509/147448 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 32063 event pairs, 879 based on Foata normal form. 15/3929 useless extension candidates. Maximal degree in co-relation 19037. Up to 2772 conditions per place. [2023-11-30 03:04:52,237 INFO L140 encePairwiseOnDemand]: 334/338 looper letters, 81 selfloop transitions, 12 changer transitions 9/335 dead transitions. [2023-11-30 03:04:52,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 335 transitions, 3604 flow [2023-11-30 03:04:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2023-11-30 03:04:52,238 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8678500986193294 [2023-11-30 03:04:52,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 880 transitions. [2023-11-30 03:04:52,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 880 transitions. [2023-11-30 03:04:52,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:52,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 880 transitions. [2023-11-30 03:04:52,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call 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,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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,242 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -17 predicate places. [2023-11-30 03:04:52,242 INFO L500 AbstractCegarLoop]: Abstraction has has 291 places, 335 transitions, 3604 flow [2023-11-30 03:04:52,242 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:52,242 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:52,242 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:04:52,242 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:52,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:52,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1204049567, now seen corresponding path program 1 times [2023-11-30 03:04:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027548728] [2023-11-30 03:04:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:04:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027548728] [2023-11-30 03:04:52,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027548728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:52,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:04:52,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106642204] [2023-11-30 03:04:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:52,515 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:04:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:52,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:04:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:04:52,516 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 338 [2023-11-30 03:04:52,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 335 transitions, 3604 flow. Second operand has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call 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,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:52,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 338 [2023-11-30 03:04:52,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:53,455 INFO L124 PetriNetUnfolderBase]: 2171/4759 cut-off events. [2023-11-30 03:04:53,455 INFO L125 PetriNetUnfolderBase]: For 160383/165996 co-relation queries the response was YES. [2023-11-30 03:04:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38813 conditions, 4759 events. 2171/4759 cut-off events. For 160383/165996 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 34661 event pairs, 781 based on Foata normal form. 24/4126 useless extension candidates. Maximal degree in co-relation 20588. Up to 2862 conditions per place. [2023-11-30 03:04:53,513 INFO L140 encePairwiseOnDemand]: 331/338 looper letters, 115 selfloop transitions, 10 changer transitions 9/340 dead transitions. [2023-11-30 03:04:53,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 340 transitions, 3880 flow [2023-11-30 03:04:53,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:04:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:04:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1593 transitions. [2023-11-30 03:04:53,516 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7855029585798816 [2023-11-30 03:04:53,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1593 transitions. [2023-11-30 03:04:53,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1593 transitions. [2023-11-30 03:04:53,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:53,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1593 transitions. [2023-11-30 03:04:53,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 265.5) internal successors, (1593), 6 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call 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:53,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:53,521 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:53,522 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -13 predicate places. [2023-11-30 03:04:53,522 INFO L500 AbstractCegarLoop]: Abstraction has has 295 places, 340 transitions, 3880 flow [2023-11-30 03:04:53,523 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call 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:53,523 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:53,523 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,523 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:04:53,523 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:53,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:53,523 INFO L85 PathProgramCache]: Analyzing trace with hash 212117526, now seen corresponding path program 1 times [2023-11-30 03:04:53,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:53,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015760378] [2023-11-30 03:04:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:53,555 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:53,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:53,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015760378] [2023-11-30 03:04:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015760378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:04:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60285721] [2023-11-30 03:04:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:53,557 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:04:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:04:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:04:53,558 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 338 [2023-11-30 03:04:53,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 340 transitions, 3880 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:53,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:53,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 338 [2023-11-30 03:04:53,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:54,465 INFO L124 PetriNetUnfolderBase]: 2790/6767 cut-off events. [2023-11-30 03:04:54,465 INFO L125 PetriNetUnfolderBase]: For 135768/140875 co-relation queries the response was YES. [2023-11-30 03:04:54,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49370 conditions, 6767 events. 2790/6767 cut-off events. For 135768/140875 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 55739 event pairs, 664 based on Foata normal form. 12/6296 useless extension candidates. Maximal degree in co-relation 22871. Up to 3365 conditions per place. [2023-11-30 03:04:54,547 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 142 selfloop transitions, 7 changer transitions 9/395 dead transitions. [2023-11-30 03:04:54,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 395 transitions, 6027 flow [2023-11-30 03:04:54,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:04:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:04:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2023-11-30 03:04:54,549 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8648915187376726 [2023-11-30 03:04:54,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 877 transitions. [2023-11-30 03:04:54,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 877 transitions. [2023-11-30 03:04:54,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:54,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 877 transitions. [2023-11-30 03:04:54,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call 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:54,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:54,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 338.0) internal successors, (1352), 4 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call 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:54,552 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -12 predicate places. [2023-11-30 03:04:54,553 INFO L500 AbstractCegarLoop]: Abstraction has has 296 places, 395 transitions, 6027 flow [2023-11-30 03:04:54,554 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:04:54,554 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:54,554 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:54,554 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:04:54,554 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:54,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1958792634, now seen corresponding path program 1 times [2023-11-30 03:04:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:54,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555962416] [2023-11-30 03:04:54,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:54,942 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:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555962416] [2023-11-30 03:04:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555962416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:04:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148098455] [2023-11-30 03:04:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:54,943 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:04:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:54,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:04:54,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:04:54,945 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 338 [2023-11-30 03:04:54,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 395 transitions, 6027 flow. Second operand has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call 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:54,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:54,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 338 [2023-11-30 03:04:54,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:56,007 INFO L124 PetriNetUnfolderBase]: 2566/5543 cut-off events. [2023-11-30 03:04:56,007 INFO L125 PetriNetUnfolderBase]: For 226037/232297 co-relation queries the response was YES. [2023-11-30 03:04:56,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52830 conditions, 5543 events. 2566/5543 cut-off events. For 226037/232297 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 40312 event pairs, 351 based on Foata normal form. 50/5236 useless extension candidates. Maximal degree in co-relation 22107. Up to 3464 conditions per place. [2023-11-30 03:04:56,080 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 548 selfloop transitions, 8 changer transitions 9/769 dead transitions. [2023-11-30 03:04:56,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 769 transitions, 19917 flow [2023-11-30 03:04:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:04:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:04:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1585 transitions. [2023-11-30 03:04:56,096 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7815581854043393 [2023-11-30 03:04:56,096 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1585 transitions. [2023-11-30 03:04:56,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1585 transitions. [2023-11-30 03:04:56,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:56,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1585 transitions. [2023-11-30 03:04:56,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 264.1666666666667) internal successors, (1585), 6 states have internal predecessors, (1585), 0 states have call successors, (0), 0 states have call 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:56,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:56,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:56,102 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -8 predicate places. [2023-11-30 03:04:56,102 INFO L500 AbstractCegarLoop]: Abstraction has has 300 places, 769 transitions, 19917 flow [2023-11-30 03:04:56,102 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call 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:56,102 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:56,102 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:56,102 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:04:56,102 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:56,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -826105457, now seen corresponding path program 1 times [2023-11-30 03:04:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541218425] [2023-11-30 03:04:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:56,480 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:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:56,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541218425] [2023-11-30 03:04:56,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541218425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:56,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:56,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:04:56,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417796041] [2023-11-30 03:04:56,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:56,481 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:04:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:56,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:04:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:04:56,484 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 338 [2023-11-30 03:04:56,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 769 transitions, 19917 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call 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:56,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:56,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 338 [2023-11-30 03:04:56,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:57,842 INFO L124 PetriNetUnfolderBase]: 2560/5499 cut-off events. [2023-11-30 03:04:57,842 INFO L125 PetriNetUnfolderBase]: For 227065/235079 co-relation queries the response was YES. [2023-11-30 03:04:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56273 conditions, 5499 events. 2560/5499 cut-off events. For 227065/235079 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 39806 event pairs, 346 based on Foata normal form. 8/5237 useless extension candidates. Maximal degree in co-relation 26465. Up to 3464 conditions per place. [2023-11-30 03:04:57,921 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 635 selfloop transitions, 4 changer transitions 9/852 dead transitions. [2023-11-30 03:04:57,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 852 transitions, 24217 flow [2023-11-30 03:04:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:04:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:04:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1572 transitions. [2023-11-30 03:04:57,924 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7751479289940828 [2023-11-30 03:04:57,924 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1572 transitions. [2023-11-30 03:04:57,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1572 transitions. [2023-11-30 03:04:57,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:57,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1572 transitions. [2023-11-30 03:04:57,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call 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:57,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:57,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:57,931 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, -4 predicate places. [2023-11-30 03:04:57,931 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 852 transitions, 24217 flow [2023-11-30 03:04:57,931 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call 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:57,931 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:04:57,931 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:57,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:04:57,931 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2023-11-30 03:04:57,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:04:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1341171264, now seen corresponding path program 1 times [2023-11-30 03:04:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:04:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151976321] [2023-11-30 03:04:57,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:04:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:04:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:04:58,294 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:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:04:58,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151976321] [2023-11-30 03:04:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151976321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:04:58,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:04:58,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:04:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793873582] [2023-11-30 03:04:58,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:04:58,296 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:04:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:04:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:04:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:04:58,297 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 338 [2023-11-30 03:04:58,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 852 transitions, 24217 flow. Second operand has 6 states, 6 states have (on average 256.6666666666667) internal successors, (1540), 6 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call 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:58,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:04:58,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 338 [2023-11-30 03:04:58,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:04:59,806 INFO L124 PetriNetUnfolderBase]: 2792/5887 cut-off events. [2023-11-30 03:04:59,807 INFO L125 PetriNetUnfolderBase]: For 247184/253355 co-relation queries the response was YES. [2023-11-30 03:04:59,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63124 conditions, 5887 events. 2792/5887 cut-off events. For 247184/253355 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 42948 event pairs, 390 based on Foata normal form. 7/5509 useless extension candidates. Maximal degree in co-relation 29146. Up to 3576 conditions per place. [2023-11-30 03:04:59,861 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 0 selfloop transitions, 0 changer transitions 859/859 dead transitions. [2023-11-30 03:04:59,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 859 transitions, 25809 flow [2023-11-30 03:04:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:04:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:04:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1559 transitions. [2023-11-30 03:04:59,867 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7687376725838264 [2023-11-30 03:04:59,867 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1559 transitions. [2023-11-30 03:04:59,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1559 transitions. [2023-11-30 03:04:59,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:04:59,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1559 transitions. [2023-11-30 03:04:59,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 259.8333333333333) internal successors, (1559), 6 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call 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:59,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:59,872 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 338.0) internal successors, (2366), 7 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call 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:59,872 INFO L307 CegarLoopForPetriNet]: 308 programPoint places, 0 predicate places. [2023-11-30 03:04:59,872 INFO L500 AbstractCegarLoop]: Abstraction has has 308 places, 859 transitions, 25809 flow [2023-11-30 03:04:59,873 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.6666666666667) internal successors, (1540), 6 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call 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:59,879 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-min-max-1.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:04:59,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (84 of 85 remaining) [2023-11-30 03:04:59,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (83 of 85 remaining) [2023-11-30 03:04:59,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (82 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (81 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (80 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (79 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (77 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (75 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (74 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (73 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (72 of 85 remaining) [2023-11-30 03:04:59,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (71 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (70 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (69 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (68 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (67 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (66 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (65 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 85 remaining) [2023-11-30 03:04:59,941 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (61 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (57 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (56 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 85 remaining) [2023-11-30 03:04:59,942 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (46 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (45 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (44 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (41 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (40 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (39 of 85 remaining) [2023-11-30 03:04:59,943 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (38 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (37 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (35 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (34 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (33 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (32 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 85 remaining) [2023-11-30 03:04:59,944 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (19 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 85 remaining) [2023-11-30 03:04:59,945 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (13 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (5 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 85 remaining) [2023-11-30 03:04:59,946 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 85 remaining) [2023-11-30 03:04:59,947 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:04:59,947 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:04:59,953 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:04:59,954 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:04:59,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:04:59 BasicIcfg [2023-11-30 03:04:59,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:04:59,960 INFO L158 Benchmark]: Toolchain (without parser) took 14857.28ms. Allocated memory was 390.1MB in the beginning and 6.3GB in the end (delta: 6.0GB). Free memory was 348.3MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-11-30 03:04:59,960 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 390.1MB. Free memory is still 342.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:04:59,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.96ms. Allocated memory is still 390.1MB. Free memory was 348.3MB in the beginning and 335.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:04:59,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.09ms. Allocated memory is still 390.1MB. Free memory was 334.9MB in the beginning and 332.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:04:59,962 INFO L158 Benchmark]: Boogie Preprocessor took 25.60ms. Allocated memory is still 390.1MB. Free memory was 332.7MB in the beginning and 329.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:04:59,962 INFO L158 Benchmark]: RCFGBuilder took 864.12ms. Allocated memory was 390.1MB in the beginning and 618.7MB in the end (delta: 228.6MB). Free memory was 329.5MB in the beginning and 575.1MB in the end (delta: -245.7MB). Peak memory consumption was 68.8MB. Max. memory is 16.0GB. [2023-11-30 03:04:59,962 INFO L158 Benchmark]: TraceAbstraction took 13697.00ms. Allocated memory was 618.7MB in the beginning and 6.3GB in the end (delta: 5.7GB). Free memory was 575.1MB in the beginning and 5.5GB in the end (delta: -5.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-11-30 03:04:59,964 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 390.1MB. Free memory is still 342.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 240.96ms. Allocated memory is still 390.1MB. Free memory was 348.3MB in the beginning and 335.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.09ms. Allocated memory is still 390.1MB. Free memory was 334.9MB in the beginning and 332.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.60ms. Allocated memory is still 390.1MB. Free memory was 332.7MB in the beginning and 329.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 864.12ms. Allocated memory was 390.1MB in the beginning and 618.7MB in the end (delta: 228.6MB). Free memory was 329.5MB in the beginning and 575.1MB in the end (delta: -245.7MB). Peak memory consumption was 68.8MB. Max. memory is 16.0GB. * TraceAbstraction took 13697.00ms. Allocated memory was 618.7MB in the beginning and 6.3GB in the end (delta: 5.7GB). Free memory was 575.1MB in the beginning and 5.5GB in the end (delta: -5.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 391 locations, 85 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: 13.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1115 IncrementalHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 210 mSDtfsCounter, 1115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25809occurred in iteration=19, InterpolantAutomatonStates: 72, 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, 2.0s InterpolantComputationTime, 1837 NumberOfCodeBlocks, 1837 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1818 ConstructedInterpolants, 0 QuantifiedInterpolants, 2285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:04:59,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...