/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-ticket-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:11:12,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:11:12,759 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:11:12,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:11:12,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:11:12,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:11:12,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:11:12,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:11:12,793 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:11:12,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:11:12,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:11:12,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:11:12,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:11:12,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:11:12,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:11:12,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:11:12,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:11:12,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:11:12,799 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:11:12,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:11:12,799 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:11:12,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:11:12,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:11:12,800 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:11:12,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:11:12,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:11:12,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:11:12,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:11:12,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:11:12,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:11:12,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:11:12,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:11:12,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:11:12,803 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:11:13,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:11:13,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:11:13,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:11:13,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:11:13,022 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:11:13,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2023-11-30 03:11:14,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:11:14,341 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:11:14,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-3.wvr.c [2023-11-30 03:11:14,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5832e75dc/845f7c3c980747889a17496984d4f692/FLAGf41cd81e4 [2023-11-30 03:11:14,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5832e75dc/845f7c3c980747889a17496984d4f692 [2023-11-30 03:11:14,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:11:14,370 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:11:14,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:11:14,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:11:14,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:11:14,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54af98f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14, skipping insertion in model container [2023-11-30 03:11:14,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,405 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:11:14,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:11:14,597 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:11:14,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:11:14,658 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:11:14,658 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:11:14,669 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:11:14,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14 WrapperNode [2023-11-30 03:11:14,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:11:14,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:11:14,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:11:14,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:11:14,678 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:11:14" (1/1) ... [2023-11-30 03:11:14,695 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:11:14" (1/1) ... [2023-11-30 03:11:14,725 INFO L138 Inliner]: procedures = 22, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 336 [2023-11-30 03:11:14,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:11:14,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:11:14,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:11:14,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:11:14,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,757 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:11:14,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:11:14,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:11:14,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:11:14,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (1/1) ... [2023-11-30 03:11:14,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:11:14,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:11:14,805 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:11:14,817 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:11:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:11:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:11:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:11:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:11:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:11:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:11:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:11:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:11:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:11:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:11:14,842 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:11:14,976 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:11:14,978 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:11:15,401 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:11:15,530 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:11:15,530 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:11:15,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:11:15 BoogieIcfgContainer [2023-11-30 03:11:15,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:11:15,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:11:15,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:11:15,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:11:15,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:11:14" (1/3) ... [2023-11-30 03:11:15,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c5f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:11:15, skipping insertion in model container [2023-11-30 03:11:15,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:14" (2/3) ... [2023-11-30 03:11:15,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c5f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:11:15, skipping insertion in model container [2023-11-30 03:11:15,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:11:15" (3/3) ... [2023-11-30 03:11:15,538 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2023-11-30 03:11:15,552 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:11:15,552 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2023-11-30 03:11:15,552 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:11:15,633 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 03:11:15,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 248 transitions, 517 flow [2023-11-30 03:11:15,730 INFO L124 PetriNetUnfolderBase]: 5/245 cut-off events. [2023-11-30 03:11:15,731 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 03:11:15,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 245 events. 5/245 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 244 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 176. Up to 2 conditions per place. [2023-11-30 03:11:15,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 248 transitions, 517 flow [2023-11-30 03:11:15,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 222 transitions, 462 flow [2023-11-30 03:11:15,753 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:11:15,758 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;@5348dff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:11:15,758 INFO L363 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2023-11-30 03:11:15,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:11:15,780 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 03:11:15,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:11:15,780 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:15,781 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:11:15,781 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:15,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash -622194825, now seen corresponding path program 1 times [2023-11-30 03:11:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:15,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326336720] [2023-11-30 03:11:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:15,996 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:11:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:15,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326336720] [2023-11-30 03:11:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326336720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:15,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050396830] [2023-11-30 03:11:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:16,006 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:16,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:16,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:16,046 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 248 [2023-11-30 03:11:16,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 222 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:16,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 248 [2023-11-30 03:11:16,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:16,309 INFO L124 PetriNetUnfolderBase]: 317/832 cut-off events. [2023-11-30 03:11:16,309 INFO L125 PetriNetUnfolderBase]: For 133/219 co-relation queries the response was YES. [2023-11-30 03:11:16,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 832 events. 317/832 cut-off events. For 133/219 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4035 event pairs, 314 based on Foata normal form. 1/793 useless extension candidates. Maximal degree in co-relation 1254. Up to 535 conditions per place. [2023-11-30 03:11:16,324 INFO L140 encePairwiseOnDemand]: 212/248 looper letters, 22 selfloop transitions, 2 changer transitions 1/188 dead transitions. [2023-11-30 03:11:16,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 188 transitions, 442 flow [2023-11-30 03:11:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-11-30 03:11:16,342 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.831989247311828 [2023-11-30 03:11:16,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-11-30 03:11:16,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-11-30 03:11:16,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:16,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-11-30 03:11:16,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,364 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -31 predicate places. [2023-11-30 03:11:16,365 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 188 transitions, 442 flow [2023-11-30 03:11:16,365 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,365 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:16,365 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:11:16,366 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:11:16,366 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:16,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2067710794, now seen corresponding path program 1 times [2023-11-30 03:11:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:16,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491269324] [2023-11-30 03:11:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:16,460 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:11:16,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491269324] [2023-11-30 03:11:16,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491269324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:16,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:16,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133541464] [2023-11-30 03:11:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:16,463 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:16,466 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 248 [2023-11-30 03:11:16,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 188 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:16,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 248 [2023-11-30 03:11:16,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:16,650 INFO L124 PetriNetUnfolderBase]: 317/831 cut-off events. [2023-11-30 03:11:16,651 INFO L125 PetriNetUnfolderBase]: For 290/5060 co-relation queries the response was YES. [2023-11-30 03:11:16,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 831 events. 317/831 cut-off events. For 290/5060 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4051 event pairs, 314 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 1763. Up to 535 conditions per place. [2023-11-30 03:11:16,660 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 22 selfloop transitions, 2 changer transitions 1/187 dead transitions. [2023-11-30 03:11:16,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 187 transitions, 488 flow [2023-11-30 03:11:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2023-11-30 03:11:16,663 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7876344086021505 [2023-11-30 03:11:16,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 586 transitions. [2023-11-30 03:11:16,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 586 transitions. [2023-11-30 03:11:16,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:16,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 586 transitions. [2023-11-30 03:11:16,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,668 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -30 predicate places. [2023-11-30 03:11:16,668 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 187 transitions, 488 flow [2023-11-30 03:11:16,669 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,669 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:16,669 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:11:16,670 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:11:16,670 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:16,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1425689527, now seen corresponding path program 1 times [2023-11-30 03:11:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:16,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615135057] [2023-11-30 03:11:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:16,733 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:11:16,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:16,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615135057] [2023-11-30 03:11:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615135057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:16,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228553731] [2023-11-30 03:11:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:16,734 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:16,736 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 248 [2023-11-30 03:11:16,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 187 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:16,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 248 [2023-11-30 03:11:16,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:16,905 INFO L124 PetriNetUnfolderBase]: 317/830 cut-off events. [2023-11-30 03:11:16,906 INFO L125 PetriNetUnfolderBase]: For 564/10018 co-relation queries the response was YES. [2023-11-30 03:11:16,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 830 events. 317/830 cut-off events. For 564/10018 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4075 event pairs, 314 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 2272. Up to 535 conditions per place. [2023-11-30 03:11:16,915 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 22 selfloop transitions, 2 changer transitions 1/186 dead transitions. [2023-11-30 03:11:16,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 186 transitions, 534 flow [2023-11-30 03:11:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 586 transitions. [2023-11-30 03:11:16,917 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7876344086021505 [2023-11-30 03:11:16,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 586 transitions. [2023-11-30 03:11:16,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 586 transitions. [2023-11-30 03:11:16,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:16,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 586 transitions. [2023-11-30 03:11:16,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,923 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -29 predicate places. [2023-11-30 03:11:16,924 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 186 transitions, 534 flow [2023-11-30 03:11:16,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:16,924 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:16,924 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:16,924 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:11:16,925 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:16,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1006052871, now seen corresponding path program 1 times [2023-11-30 03:11:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:16,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911298234] [2023-11-30 03:11:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:16,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:16,997 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:11:16,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:16,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911298234] [2023-11-30 03:11:16,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911298234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785822276] [2023-11-30 03:11:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:16,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:17,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:17,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:17,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:17,005 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 248 [2023-11-30 03:11:17,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 186 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:17,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 248 [2023-11-30 03:11:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:17,195 INFO L124 PetriNetUnfolderBase]: 317/829 cut-off events. [2023-11-30 03:11:17,196 INFO L125 PetriNetUnfolderBase]: For 955/15093 co-relation queries the response was YES. [2023-11-30 03:11:17,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 829 events. 317/829 cut-off events. For 955/15093 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4067 event pairs, 314 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 2781. Up to 544 conditions per place. [2023-11-30 03:11:17,205 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 31 selfloop transitions, 2 changer transitions 1/185 dead transitions. [2023-11-30 03:11:17,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 185 transitions, 598 flow [2023-11-30 03:11:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2023-11-30 03:11:17,208 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7634408602150538 [2023-11-30 03:11:17,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2023-11-30 03:11:17,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2023-11-30 03:11:17,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:17,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2023-11-30 03:11:17,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,215 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -28 predicate places. [2023-11-30 03:11:17,215 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 185 transitions, 598 flow [2023-11-30 03:11:17,215 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,215 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:17,216 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:17,216 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:11:17,217 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:17,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash 897088901, now seen corresponding path program 1 times [2023-11-30 03:11:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676047128] [2023-11-30 03:11:17,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:17,290 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:11:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676047128] [2023-11-30 03:11:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676047128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:17,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:17,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101604806] [2023-11-30 03:11:17,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:17,292 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:17,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:17,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:17,294 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 248 [2023-11-30 03:11:17,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 185 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:17,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 248 [2023-11-30 03:11:17,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:17,505 INFO L124 PetriNetUnfolderBase]: 317/828 cut-off events. [2023-11-30 03:11:17,505 INFO L125 PetriNetUnfolderBase]: For 1463/20285 co-relation queries the response was YES. [2023-11-30 03:11:17,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 828 events. 317/828 cut-off events. For 1463/20285 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4055 event pairs, 314 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 3290. Up to 544 conditions per place. [2023-11-30 03:11:17,514 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 25 selfloop transitions, 2 changer transitions 1/184 dead transitions. [2023-11-30 03:11:17,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 184 transitions, 650 flow [2023-11-30 03:11:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-11-30 03:11:17,516 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7795698924731183 [2023-11-30 03:11:17,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-11-30 03:11:17,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-11-30 03:11:17,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:17,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-11-30 03:11:17,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,522 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -27 predicate places. [2023-11-30 03:11:17,522 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 184 transitions, 650 flow [2023-11-30 03:11:17,523 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,523 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:17,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] [2023-11-30 03:11:17,523 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:11:17,524 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:17,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash -861555027, now seen corresponding path program 1 times [2023-11-30 03:11:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010132207] [2023-11-30 03:11:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:17,597 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:11:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010132207] [2023-11-30 03:11:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010132207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:17,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150118895] [2023-11-30 03:11:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:17,601 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:17,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:17,602 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 248 [2023-11-30 03:11:17,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 184 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:17,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 248 [2023-11-30 03:11:17,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:17,769 INFO L124 PetriNetUnfolderBase]: 317/827 cut-off events. [2023-11-30 03:11:17,769 INFO L125 PetriNetUnfolderBase]: For 2088/25594 co-relation queries the response was YES. [2023-11-30 03:11:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 827 events. 317/827 cut-off events. For 2088/25594 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4032 event pairs, 314 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 3799. Up to 544 conditions per place. [2023-11-30 03:11:17,779 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 25 selfloop transitions, 2 changer transitions 1/183 dead transitions. [2023-11-30 03:11:17,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 183 transitions, 702 flow [2023-11-30 03:11:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-11-30 03:11:17,781 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7795698924731183 [2023-11-30 03:11:17,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-11-30 03:11:17,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-11-30 03:11:17,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:17,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-11-30 03:11:17,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,788 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -26 predicate places. [2023-11-30 03:11:17,788 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 183 transitions, 702 flow [2023-11-30 03:11:17,788 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,788 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:17,788 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] [2023-11-30 03:11:17,789 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:11:17,789 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:17,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:17,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1643654802, now seen corresponding path program 1 times [2023-11-30 03:11:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:17,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461186880] [2023-11-30 03:11:17,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:17,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:17,830 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:11:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461186880] [2023-11-30 03:11:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461186880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615914907] [2023-11-30 03:11:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:17,835 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:17,836 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 248 [2023-11-30 03:11:17,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 183 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:17,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:17,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 248 [2023-11-30 03:11:17,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:17,997 INFO L124 PetriNetUnfolderBase]: 317/826 cut-off events. [2023-11-30 03:11:17,997 INFO L125 PetriNetUnfolderBase]: For 2830/31020 co-relation queries the response was YES. [2023-11-30 03:11:17,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 826 events. 317/826 cut-off events. For 2830/31020 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4036 event pairs, 314 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 4308. Up to 544 conditions per place. [2023-11-30 03:11:18,008 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 27 selfloop transitions, 2 changer transitions 1/182 dead transitions. [2023-11-30 03:11:18,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 182 transitions, 758 flow [2023-11-30 03:11:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-11-30 03:11:18,010 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7701612903225806 [2023-11-30 03:11:18,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-11-30 03:11:18,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-11-30 03:11:18,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:18,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-11-30 03:11:18,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,013 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -25 predicate places. [2023-11-30 03:11:18,013 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 182 transitions, 758 flow [2023-11-30 03:11:18,014 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,014 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:18,014 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:18,014 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:11:18,014 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:18,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash 932045146, now seen corresponding path program 1 times [2023-11-30 03:11:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:18,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475623497] [2023-11-30 03:11:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:18,045 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:11:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:18,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475623497] [2023-11-30 03:11:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475623497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:18,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661951061] [2023-11-30 03:11:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:18,046 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:18,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:18,048 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 248 [2023-11-30 03:11:18,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 182 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:18,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 248 [2023-11-30 03:11:18,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:18,302 INFO L124 PetriNetUnfolderBase]: 396/1164 cut-off events. [2023-11-30 03:11:18,302 INFO L125 PetriNetUnfolderBase]: For 4274/38449 co-relation queries the response was YES. [2023-11-30 03:11:18,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6841 conditions, 1164 events. 396/1164 cut-off events. For 4274/38449 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6836 event pairs, 195 based on Foata normal form. 1/1116 useless extension candidates. Maximal degree in co-relation 6356. Up to 694 conditions per place. [2023-11-30 03:11:18,315 INFO L140 encePairwiseOnDemand]: 238/248 looper letters, 37 selfloop transitions, 7 changer transitions 1/196 dead transitions. [2023-11-30 03:11:18,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 196 transitions, 1118 flow [2023-11-30 03:11:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2023-11-30 03:11:18,317 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7970430107526881 [2023-11-30 03:11:18,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2023-11-30 03:11:18,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2023-11-30 03:11:18,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:18,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2023-11-30 03:11:18,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,324 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -26 predicate places. [2023-11-30 03:11:18,325 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 196 transitions, 1118 flow [2023-11-30 03:11:18,325 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,326 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:18,326 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] [2023-11-30 03:11:18,326 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:11:18,327 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:18,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1952757522, now seen corresponding path program 1 times [2023-11-30 03:11:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980373493] [2023-11-30 03:11:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:18,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:18,381 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:11:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980373493] [2023-11-30 03:11:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980373493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:18,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806382449] [2023-11-30 03:11:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:18,383 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:18,385 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 248 [2023-11-30 03:11:18,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 196 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:18,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 248 [2023-11-30 03:11:18,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:18,591 INFO L124 PetriNetUnfolderBase]: 396/1201 cut-off events. [2023-11-30 03:11:18,591 INFO L125 PetriNetUnfolderBase]: For 4627/10342 co-relation queries the response was YES. [2023-11-30 03:11:18,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7566 conditions, 1201 events. 396/1201 cut-off events. For 4627/10342 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7078 event pairs, 167 based on Foata normal form. 1/1120 useless extension candidates. Maximal degree in co-relation 6127. Up to 694 conditions per place. [2023-11-30 03:11:18,609 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 41 selfloop transitions, 4 changer transitions 1/200 dead transitions. [2023-11-30 03:11:18,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 200 transitions, 1300 flow [2023-11-30 03:11:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2023-11-30 03:11:18,611 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7970430107526881 [2023-11-30 03:11:18,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2023-11-30 03:11:18,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2023-11-30 03:11:18,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:18,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2023-11-30 03:11:18,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,616 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -25 predicate places. [2023-11-30 03:11:18,616 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 200 transitions, 1300 flow [2023-11-30 03:11:18,618 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:18,618 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] [2023-11-30 03:11:18,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:11:18,618 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:18,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash 253651319, now seen corresponding path program 1 times [2023-11-30 03:11:18,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:18,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524166975] [2023-11-30 03:11:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:18,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:18,679 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:11:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524166975] [2023-11-30 03:11:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524166975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:18,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654612590] [2023-11-30 03:11:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:18,681 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:18,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:18,682 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 248 [2023-11-30 03:11:18,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 200 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:18,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:18,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 248 [2023-11-30 03:11:18,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:19,009 INFO L124 PetriNetUnfolderBase]: 565/1589 cut-off events. [2023-11-30 03:11:19,009 INFO L125 PetriNetUnfolderBase]: For 8696/91778 co-relation queries the response was YES. [2023-11-30 03:11:19,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11479 conditions, 1589 events. 565/1589 cut-off events. For 8696/91778 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10259 event pairs, 222 based on Foata normal form. 0/1519 useless extension candidates. Maximal degree in co-relation 7692. Up to 975 conditions per place. [2023-11-30 03:11:19,033 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 73 selfloop transitions, 3 changer transitions 1/230 dead transitions. [2023-11-30 03:11:19,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 230 transitions, 2086 flow [2023-11-30 03:11:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2023-11-30 03:11:19,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8091397849462365 [2023-11-30 03:11:19,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 602 transitions. [2023-11-30 03:11:19,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 602 transitions. [2023-11-30 03:11:19,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:19,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 602 transitions. [2023-11-30 03:11:19,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,039 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -24 predicate places. [2023-11-30 03:11:19,039 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 230 transitions, 2086 flow [2023-11-30 03:11:19,039 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,040 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:19,040 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] [2023-11-30 03:11:19,040 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:11:19,040 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:19,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 913137370, now seen corresponding path program 1 times [2023-11-30 03:11:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:19,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058675641] [2023-11-30 03:11:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:19,069 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:11:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058675641] [2023-11-30 03:11:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058675641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:19,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67619321] [2023-11-30 03:11:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:19,070 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:19,072 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 248 [2023-11-30 03:11:19,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 230 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:19,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 248 [2023-11-30 03:11:19,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:19,550 INFO L124 PetriNetUnfolderBase]: 811/2161 cut-off events. [2023-11-30 03:11:19,550 INFO L125 PetriNetUnfolderBase]: For 13944/48024 co-relation queries the response was YES. [2023-11-30 03:11:19,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17346 conditions, 2161 events. 811/2161 cut-off events. For 13944/48024 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14551 event pairs, 301 based on Foata normal form. 1/2030 useless extension candidates. Maximal degree in co-relation 7269. Up to 1360 conditions per place. [2023-11-30 03:11:19,589 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 114 selfloop transitions, 7 changer transitions 4/274 dead transitions. [2023-11-30 03:11:19,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 274 transitions, 3378 flow [2023-11-30 03:11:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2023-11-30 03:11:19,591 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2023-11-30 03:11:19,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2023-11-30 03:11:19,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2023-11-30 03:11:19,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:19,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2023-11-30 03:11:19,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,595 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -24 predicate places. [2023-11-30 03:11:19,595 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 274 transitions, 3378 flow [2023-11-30 03:11:19,596 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,596 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:19,596 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] [2023-11-30 03:11:19,596 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:11:19,596 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:19,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1999388158, now seen corresponding path program 1 times [2023-11-30 03:11:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991768214] [2023-11-30 03:11:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:20,024 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:11:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991768214] [2023-11-30 03:11:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991768214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002984901] [2023-11-30 03:11:20,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:20,026 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:20,027 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 248 [2023-11-30 03:11:20,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 274 transitions, 3378 flow. Second operand has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:20,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 248 [2023-11-30 03:11:20,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:22,388 INFO L124 PetriNetUnfolderBase]: 7015/10996 cut-off events. [2023-11-30 03:11:22,388 INFO L125 PetriNetUnfolderBase]: For 360548/366488 co-relation queries the response was YES. [2023-11-30 03:11:22,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104630 conditions, 10996 events. 7015/10996 cut-off events. For 360548/366488 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 69198 event pairs, 856 based on Foata normal form. 0/10866 useless extension candidates. Maximal degree in co-relation 53151. Up to 7564 conditions per place. [2023-11-30 03:11:22,580 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 477 selfloop transitions, 4 changer transitions 5/617 dead transitions. [2023-11-30 03:11:22,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 617 transitions, 12598 flow [2023-11-30 03:11:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1107 transitions. [2023-11-30 03:11:22,583 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7439516129032258 [2023-11-30 03:11:22,583 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1107 transitions. [2023-11-30 03:11:22,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1107 transitions. [2023-11-30 03:11:22,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:22,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1107 transitions. [2023-11-30 03:11:22,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.5) internal successors, (1107), 6 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,589 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,589 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -20 predicate places. [2023-11-30 03:11:22,589 INFO L500 AbstractCegarLoop]: Abstraction has has 208 places, 617 transitions, 12598 flow [2023-11-30 03:11:22,590 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,590 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:22,590 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] [2023-11-30 03:11:22,590 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:11:22,590 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:22,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 195686464, now seen corresponding path program 1 times [2023-11-30 03:11:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032892684] [2023-11-30 03:11:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:23,172 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:11:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032892684] [2023-11-30 03:11:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032892684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240901267] [2023-11-30 03:11:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:23,173 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:23,176 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 248 [2023-11-30 03:11:23,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 617 transitions, 12598 flow. Second operand has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:23,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:23,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 248 [2023-11-30 03:11:23,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:25,774 INFO L124 PetriNetUnfolderBase]: 7031/10949 cut-off events. [2023-11-30 03:11:25,775 INFO L125 PetriNetUnfolderBase]: For 364611/371069 co-relation queries the response was YES. [2023-11-30 03:11:25,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114576 conditions, 10949 events. 7031/10949 cut-off events. For 364611/371069 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 67886 event pairs, 864 based on Foata normal form. 0/10859 useless extension candidates. Maximal degree in co-relation 58093. Up to 9009 conditions per place. [2023-11-30 03:11:26,072 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 588 selfloop transitions, 4 changer transitions 5/728 dead transitions. [2023-11-30 03:11:26,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 728 transitions, 16694 flow [2023-11-30 03:11:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1086 transitions. [2023-11-30 03:11:26,076 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7298387096774194 [2023-11-30 03:11:26,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1086 transitions. [2023-11-30 03:11:26,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1086 transitions. [2023-11-30 03:11:26,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:26,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1086 transitions. [2023-11-30 03:11:26,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,083 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,084 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -16 predicate places. [2023-11-30 03:11:26,085 INFO L500 AbstractCegarLoop]: Abstraction has has 212 places, 728 transitions, 16694 flow [2023-11-30 03:11:26,085 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,085 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:26,085 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] [2023-11-30 03:11:26,086 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:11:26,086 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 80 more)] === [2023-11-30 03:11:26,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 497925805, now seen corresponding path program 1 times [2023-11-30 03:11:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207902543] [2023-11-30 03:11:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:26,717 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:11:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:26,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207902543] [2023-11-30 03:11:26,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207902543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:26,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:26,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934071053] [2023-11-30 03:11:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:26,719 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:26,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:26,721 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 248 [2023-11-30 03:11:26,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 728 transitions, 16694 flow. Second operand has 6 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:26,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 248 [2023-11-30 03:11:26,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:29,322 INFO L124 PetriNetUnfolderBase]: 7165/11218 cut-off events. [2023-11-30 03:11:29,322 INFO L125 PetriNetUnfolderBase]: For 359993/359993 co-relation queries the response was YES. [2023-11-30 03:11:29,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126569 conditions, 11218 events. 7165/11218 cut-off events. For 359993/359993 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 70638 event pairs, 950 based on Foata normal form. 0/11165 useless extension candidates. Maximal degree in co-relation 64075. Up to 9930 conditions per place. [2023-11-30 03:11:29,379 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 0 selfloop transitions, 0 changer transitions 751/751 dead transitions. [2023-11-30 03:11:29,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 751 transitions, 18594 flow [2023-11-30 03:11:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1069 transitions. [2023-11-30 03:11:29,383 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7184139784946236 [2023-11-30 03:11:29,383 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1069 transitions. [2023-11-30 03:11:29,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1069 transitions. [2023-11-30 03:11:29,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:29,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1069 transitions. [2023-11-30 03:11:29,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 178.16666666666666) internal successors, (1069), 6 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:29,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:29,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:29,389 INFO L307 CegarLoopForPetriNet]: 228 programPoint places, -12 predicate places. [2023-11-30 03:11:29,389 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 751 transitions, 18594 flow [2023-11-30 03:11:29,389 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:29,397 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-3.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:11:29,435 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 84 remaining) [2023-11-30 03:11:29,435 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (82 of 84 remaining) [2023-11-30 03:11:29,435 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (81 of 84 remaining) [2023-11-30 03:11:29,435 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (80 of 84 remaining) [2023-11-30 03:11:29,436 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (79 of 84 remaining) [2023-11-30 03:11:29,436 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (78 of 84 remaining) [2023-11-30 03:11:29,436 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (77 of 84 remaining) [2023-11-30 03:11:29,436 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (76 of 84 remaining) [2023-11-30 03:11:29,436 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (75 of 84 remaining) [2023-11-30 03:11:29,436 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (74 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (73 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (72 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (70 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (69 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (68 of 84 remaining) [2023-11-30 03:11:29,437 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (67 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (66 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (65 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (62 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (61 of 84 remaining) [2023-11-30 03:11:29,438 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (60 of 84 remaining) [2023-11-30 03:11:29,439 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (59 of 84 remaining) [2023-11-30 03:11:29,439 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (58 of 84 remaining) [2023-11-30 03:11:29,439 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (57 of 84 remaining) [2023-11-30 03:11:29,439 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (56 of 84 remaining) [2023-11-30 03:11:29,439 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (55 of 84 remaining) [2023-11-30 03:11:29,439 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (54 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (53 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (51 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (50 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (49 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 84 remaining) [2023-11-30 03:11:29,440 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (47 of 84 remaining) [2023-11-30 03:11:29,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (46 of 84 remaining) [2023-11-30 03:11:29,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (45 of 84 remaining) [2023-11-30 03:11:29,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (44 of 84 remaining) [2023-11-30 03:11:29,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (43 of 84 remaining) [2023-11-30 03:11:29,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (42 of 84 remaining) [2023-11-30 03:11:29,441 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (41 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (40 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (39 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (38 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (37 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (36 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (35 of 84 remaining) [2023-11-30 03:11:29,442 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 84 remaining) [2023-11-30 03:11:29,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 84 remaining) [2023-11-30 03:11:29,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 84 remaining) [2023-11-30 03:11:29,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 84 remaining) [2023-11-30 03:11:29,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 84 remaining) [2023-11-30 03:11:29,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 84 remaining) [2023-11-30 03:11:29,443 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 84 remaining) [2023-11-30 03:11:29,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 84 remaining) [2023-11-30 03:11:29,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 84 remaining) [2023-11-30 03:11:29,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (23 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 84 remaining) [2023-11-30 03:11:29,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 84 remaining) [2023-11-30 03:11:29,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (16 of 84 remaining) [2023-11-30 03:11:29,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 84 remaining) [2023-11-30 03:11:29,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 84 remaining) [2023-11-30 03:11:29,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 84 remaining) [2023-11-30 03:11:29,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (12 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (11 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (6 of 84 remaining) [2023-11-30 03:11:29,447 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 84 remaining) [2023-11-30 03:11:29,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 84 remaining) [2023-11-30 03:11:29,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 84 remaining) [2023-11-30 03:11:29,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 84 remaining) [2023-11-30 03:11:29,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (1 of 84 remaining) [2023-11-30 03:11:29,448 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 84 remaining) [2023-11-30 03:11:29,448 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:11:29,449 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:29,454 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:11:29,454 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:11:29,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:11:29 BasicIcfg [2023-11-30 03:11:29,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:11:29,462 INFO L158 Benchmark]: Toolchain (without parser) took 15091.71ms. Allocated memory was 507.5MB in the beginning and 6.1GB in the end (delta: 5.6GB). Free memory was 463.4MB in the beginning and 5.5GB in the end (delta: -5.0GB). Peak memory consumption was 791.6MB. Max. memory is 16.0GB. [2023-11-30 03:11:29,462 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 348.1MB. Free memory is still 298.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:11:29,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.52ms. Allocated memory is still 507.5MB. Free memory was 463.4MB in the beginning and 450.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:11:29,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 507.5MB. Free memory was 450.9MB in the beginning and 448.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:11:29,463 INFO L158 Benchmark]: Boogie Preprocessor took 43.37ms. Allocated memory is still 507.5MB. Free memory was 448.2MB in the beginning and 446.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:11:29,463 INFO L158 Benchmark]: RCFGBuilder took 761.76ms. Allocated memory is still 507.5MB. Free memory was 446.2MB in the beginning and 399.3MB in the end (delta: 46.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. [2023-11-30 03:11:29,463 INFO L158 Benchmark]: TraceAbstraction took 13927.80ms. Allocated memory was 507.5MB in the beginning and 6.1GB in the end (delta: 5.6GB). Free memory was 398.4MB in the beginning and 5.5GB in the end (delta: -5.1GB). Peak memory consumption was 726.6MB. Max. memory is 16.0GB. [2023-11-30 03:11:29,464 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.12ms. Allocated memory is still 348.1MB. Free memory is still 298.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 297.52ms. Allocated memory is still 507.5MB. Free memory was 463.4MB in the beginning and 450.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 507.5MB. Free memory was 450.9MB in the beginning and 448.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.37ms. Allocated memory is still 507.5MB. Free memory was 448.2MB in the beginning and 446.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 761.76ms. Allocated memory is still 507.5MB. Free memory was 446.2MB in the beginning and 399.3MB in the end (delta: 46.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. * TraceAbstraction took 13927.80ms. Allocated memory was 507.5MB in the beginning and 6.1GB in the end (delta: 5.6GB). Free memory was 398.4MB in the beginning and 5.5GB in the end (delta: -5.1GB). Peak memory consumption was 726.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: 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: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: 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, 304 locations, 84 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.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 93 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18594occurred in iteration=14, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1036 ConstructedInterpolants, 0 QuantifiedInterpolants, 1301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 49 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:11:29,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...