/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:01:53,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:01:53,222 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:01:53,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:01:53,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:01:53,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:01:53,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:01:53,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:01:53,245 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:01:53,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:01:53,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:01:53,248 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:01:53,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:01:53,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:01:53,250 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:01:53,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:01:53,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:01:53,251 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:01:53,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:01:53,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:01:53,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:01:53,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:01:53,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:01:53,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:01:53,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:01:53,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:01:53,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:01:53,253 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:01:53,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:01:53,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:01:53,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:01:53,405 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:01:53,405 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:01:53,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2023-11-30 03:01:54,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:01:54,511 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:01:54,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2023-11-30 03:01:54,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0e90392/dce791c2960048cfba3f12488c7a3d62/FLAGed84d8a5e [2023-11-30 03:01:54,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0e90392/dce791c2960048cfba3f12488c7a3d62 [2023-11-30 03:01:54,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:01:54,530 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:01:54,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:01:54,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:01:54,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:01:54,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e307fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54, skipping insertion in model container [2023-11-30 03:01:54,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:01:54,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:01:54,672 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:01:54,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:01:54,701 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:01:54,701 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:01:54,707 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:01:54,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54 WrapperNode [2023-11-30 03:01:54,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:01:54,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:01:54,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:01:54,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:01:54,713 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:01:54" (1/1) ... [2023-11-30 03:01:54,718 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:01:54" (1/1) ... [2023-11-30 03:01:54,743 INFO L138 Inliner]: procedures = 21, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 356 [2023-11-30 03:01:54,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:01:54,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:01:54,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:01:54,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:01:54,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:01:54,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:01:54,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:01:54,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:01:54,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (1/1) ... [2023-11-30 03:01:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:01:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:01:54,833 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:01:54,850 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:01:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:01:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:01:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:01:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:01:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:01:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:01:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:01:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:01:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:01:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:01:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:01:54,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:01:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:01:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:01:54,874 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:01:54,954 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:01:54,956 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:01:55,283 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:01:55,459 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:01:55,459 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:01:55,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:55 BoogieIcfgContainer [2023-11-30 03:01:55,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:01:55,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:01:55,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:01:55,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:01:55,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:01:54" (1/3) ... [2023-11-30 03:01:55,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad6ecb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:55, skipping insertion in model container [2023-11-30 03:01:55,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:54" (2/3) ... [2023-11-30 03:01:55,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad6ecb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:55, skipping insertion in model container [2023-11-30 03:01:55,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:55" (3/3) ... [2023-11-30 03:01:55,468 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2023-11-30 03:01:55,482 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:01:55,482 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2023-11-30 03:01:55,482 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:01:55,539 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:01:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 240 transitions, 494 flow [2023-11-30 03:01:55,654 INFO L124 PetriNetUnfolderBase]: 6/238 cut-off events. [2023-11-30 03:01:55,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:01:55,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 238 events. 6/238 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 315 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2023-11-30 03:01:55,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 240 transitions, 494 flow [2023-11-30 03:01:55,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 217 transitions, 446 flow [2023-11-30 03:01:55,686 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:01:55,691 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;@1a136868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:01:55,691 INFO L363 AbstractCegarLoop]: Starting to check reachability of 97 error locations. [2023-11-30 03:01:55,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:01:55,701 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 03:01:55,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:01:55,701 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:55,701 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] [2023-11-30 03:01:55,702 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:55,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash -541575811, now seen corresponding path program 1 times [2023-11-30 03:01:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:55,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209824246] [2023-11-30 03:01:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:55,864 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:01:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209824246] [2023-11-30 03:01:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209824246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45518426] [2023-11-30 03:01:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:55,875 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:55,904 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 240 [2023-11-30 03:01:55,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 217 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:55,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:55,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 240 [2023-11-30 03:01:55,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:56,059 INFO L124 PetriNetUnfolderBase]: 103/415 cut-off events. [2023-11-30 03:01:56,060 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-30 03:01:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 415 events. 103/415 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1294 event pairs, 99 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 471. Up to 227 conditions per place. [2023-11-30 03:01:56,065 INFO L140 encePairwiseOnDemand]: 196/240 looper letters, 28 selfloop transitions, 2 changer transitions 1/175 dead transitions. [2023-11-30 03:01:56,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 422 flow [2023-11-30 03:01:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-11-30 03:01:56,079 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7875 [2023-11-30 03:01:56,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-11-30 03:01:56,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-11-30 03:01:56,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:56,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-11-30 03:01:56,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,096 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -39 predicate places. [2023-11-30 03:01:56,097 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 422 flow [2023-11-30 03:01:56,097 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,097 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:56,097 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] [2023-11-30 03:01:56,097 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:01:56,098 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:56,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1753624169, now seen corresponding path program 1 times [2023-11-30 03:01:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:56,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828139134] [2023-11-30 03:01:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:56,162 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:01:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828139134] [2023-11-30 03:01:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828139134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987528333] [2023-11-30 03:01:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:56,165 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:56,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:56,167 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 240 [2023-11-30 03:01:56,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:56,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 240 [2023-11-30 03:01:56,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:56,313 INFO L124 PetriNetUnfolderBase]: 103/414 cut-off events. [2023-11-30 03:01:56,314 INFO L125 PetriNetUnfolderBase]: For 77/103 co-relation queries the response was YES. [2023-11-30 03:01:56,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 414 events. 103/414 cut-off events. For 77/103 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1307 event pairs, 99 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 670. Up to 227 conditions per place. [2023-11-30 03:01:56,318 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 28 selfloop transitions, 2 changer transitions 1/174 dead transitions. [2023-11-30 03:01:56,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 480 flow [2023-11-30 03:01:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2023-11-30 03:01:56,320 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7305555555555555 [2023-11-30 03:01:56,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:56,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,324 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -38 predicate places. [2023-11-30 03:01:56,324 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 174 transitions, 480 flow [2023-11-30 03:01:56,324 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,324 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:56,324 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] [2023-11-30 03:01:56,325 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:01:56,325 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:56,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash -796426354, now seen corresponding path program 1 times [2023-11-30 03:01:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:56,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135530525] [2023-11-30 03:01:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:56,391 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:01:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135530525] [2023-11-30 03:01:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135530525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:56,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:56,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290662936] [2023-11-30 03:01:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:56,393 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:56,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:56,396 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 240 [2023-11-30 03:01:56,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 174 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:56,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 240 [2023-11-30 03:01:56,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:56,489 INFO L124 PetriNetUnfolderBase]: 103/413 cut-off events. [2023-11-30 03:01:56,489 INFO L125 PetriNetUnfolderBase]: For 125/177 co-relation queries the response was YES. [2023-11-30 03:01:56,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 413 events. 103/413 cut-off events. For 125/177 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1309 event pairs, 99 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 869. Up to 227 conditions per place. [2023-11-30 03:01:56,492 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 28 selfloop transitions, 2 changer transitions 1/173 dead transitions. [2023-11-30 03:01:56,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 173 transitions, 538 flow [2023-11-30 03:01:56,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2023-11-30 03:01:56,494 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7305555555555555 [2023-11-30 03:01:56,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:56,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,498 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -37 predicate places. [2023-11-30 03:01:56,498 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 173 transitions, 538 flow [2023-11-30 03:01:56,499 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,499 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:56,499 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] [2023-11-30 03:01:56,499 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:01:56,499 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:56,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 640810446, now seen corresponding path program 1 times [2023-11-30 03:01:56,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472344320] [2023-11-30 03:01:56,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:56,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:56,556 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:01:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472344320] [2023-11-30 03:01:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472344320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:56,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203840810] [2023-11-30 03:01:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:56,557 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:56,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:56,558 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 240 [2023-11-30 03:01:56,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 173 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:56,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 240 [2023-11-30 03:01:56,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:56,641 INFO L124 PetriNetUnfolderBase]: 103/412 cut-off events. [2023-11-30 03:01:56,642 INFO L125 PetriNetUnfolderBase]: For 188/266 co-relation queries the response was YES. [2023-11-30 03:01:56,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 412 events. 103/412 cut-off events. For 188/266 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1318 event pairs, 99 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 1068. Up to 227 conditions per place. [2023-11-30 03:01:56,645 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 28 selfloop transitions, 2 changer transitions 1/172 dead transitions. [2023-11-30 03:01:56,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 172 transitions, 596 flow [2023-11-30 03:01:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2023-11-30 03:01:56,646 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7305555555555555 [2023-11-30 03:01:56,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:56,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2023-11-30 03:01:56,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,651 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -36 predicate places. [2023-11-30 03:01:56,651 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 172 transitions, 596 flow [2023-11-30 03:01:56,651 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,651 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:56,652 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] [2023-11-30 03:01:56,652 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:01:56,652 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:56,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1950762932, now seen corresponding path program 1 times [2023-11-30 03:01:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082633879] [2023-11-30 03:01:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:56,699 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:01:56,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:56,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082633879] [2023-11-30 03:01:56,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082633879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:56,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:56,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392433733] [2023-11-30 03:01:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:56,701 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:56,702 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 240 [2023-11-30 03:01:56,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 172 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:56,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 240 [2023-11-30 03:01:56,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:56,790 INFO L124 PetriNetUnfolderBase]: 103/411 cut-off events. [2023-11-30 03:01:56,791 INFO L125 PetriNetUnfolderBase]: For 266/370 co-relation queries the response was YES. [2023-11-30 03:01:56,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 411 events. 103/411 cut-off events. For 266/370 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1308 event pairs, 99 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 1267. Up to 229 conditions per place. [2023-11-30 03:01:56,794 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 30 selfloop transitions, 2 changer transitions 1/171 dead transitions. [2023-11-30 03:01:56,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 171 transitions, 658 flow [2023-11-30 03:01:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2023-11-30 03:01:56,795 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333 [2023-11-30 03:01:56,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2023-11-30 03:01:56,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2023-11-30 03:01:56,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:56,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2023-11-30 03:01:56,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,801 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -35 predicate places. [2023-11-30 03:01:56,801 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 171 transitions, 658 flow [2023-11-30 03:01:56,801 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,801 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:56,801 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] [2023-11-30 03:01:56,801 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:01:56,802 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:56,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1108896400, now seen corresponding path program 1 times [2023-11-30 03:01:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133964102] [2023-11-30 03:01:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:56,871 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:01:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133964102] [2023-11-30 03:01:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133964102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:56,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:56,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539674144] [2023-11-30 03:01:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:56,874 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:56,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:56,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:56,875 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2023-11-30 03:01:56,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 171 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:56,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2023-11-30 03:01:56,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:56,944 INFO L124 PetriNetUnfolderBase]: 103/410 cut-off events. [2023-11-30 03:01:56,945 INFO L125 PetriNetUnfolderBase]: For 359/489 co-relation queries the response was YES. [2023-11-30 03:01:56,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 410 events. 103/410 cut-off events. For 359/489 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1291 event pairs, 99 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 1466. Up to 229 conditions per place. [2023-11-30 03:01:56,948 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 25 selfloop transitions, 2 changer transitions 1/170 dead transitions. [2023-11-30 03:01:56,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 170 transitions, 710 flow [2023-11-30 03:01:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2023-11-30 03:01:56,949 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7388888888888889 [2023-11-30 03:01:56,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2023-11-30 03:01:56,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2023-11-30 03:01:56,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:56,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2023-11-30 03:01:56,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,954 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -34 predicate places. [2023-11-30 03:01:56,954 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 170 transitions, 710 flow [2023-11-30 03:01:56,955 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:56,955 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:56,955 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:56,955 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:01:56,955 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:56,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 132045593, now seen corresponding path program 1 times [2023-11-30 03:01:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743600837] [2023-11-30 03:01:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:56,993 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:01:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743600837] [2023-11-30 03:01:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743600837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738516829] [2023-11-30 03:01:56,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:56,997 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:56,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:56,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:56,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:56,999 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2023-11-30 03:01:57,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 170 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:57,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2023-11-30 03:01:57,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:57,117 INFO L124 PetriNetUnfolderBase]: 103/409 cut-off events. [2023-11-30 03:01:57,118 INFO L125 PetriNetUnfolderBase]: For 467/623 co-relation queries the response was YES. [2023-11-30 03:01:57,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 409 events. 103/409 cut-off events. For 467/623 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1315 event pairs, 99 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 1665. Up to 229 conditions per place. [2023-11-30 03:01:57,121 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 25 selfloop transitions, 2 changer transitions 1/169 dead transitions. [2023-11-30 03:01:57,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 169 transitions, 762 flow [2023-11-30 03:01:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2023-11-30 03:01:57,123 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7388888888888889 [2023-11-30 03:01:57,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2023-11-30 03:01:57,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2023-11-30 03:01:57,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:57,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2023-11-30 03:01:57,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,155 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -33 predicate places. [2023-11-30 03:01:57,155 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 169 transitions, 762 flow [2023-11-30 03:01:57,155 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,155 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:57,155 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:57,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:01:57,155 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:57,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash -103231397, now seen corresponding path program 1 times [2023-11-30 03:01:57,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:57,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409154424] [2023-11-30 03:01:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:57,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:57,178 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:01:57,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:57,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409154424] [2023-11-30 03:01:57,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409154424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:57,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:57,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:57,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974493450] [2023-11-30 03:01:57,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:57,179 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:57,180 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 240 [2023-11-30 03:01:57,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 169 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:57,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 240 [2023-11-30 03:01:57,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:57,271 INFO L124 PetriNetUnfolderBase]: 106/465 cut-off events. [2023-11-30 03:01:57,272 INFO L125 PetriNetUnfolderBase]: For 854/1066 co-relation queries the response was YES. [2023-11-30 03:01:57,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 465 events. 106/465 cut-off events. For 854/1066 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1656 event pairs, 60 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1987. Up to 235 conditions per place. [2023-11-30 03:01:57,275 INFO L140 encePairwiseOnDemand]: 232/240 looper letters, 40 selfloop transitions, 5 changer transitions 4/187 dead transitions. [2023-11-30 03:01:57,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 187 transitions, 1174 flow [2023-11-30 03:01:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2023-11-30 03:01:57,277 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7597222222222222 [2023-11-30 03:01:57,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2023-11-30 03:01:57,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2023-11-30 03:01:57,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:57,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2023-11-30 03:01:57,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:57,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,279 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -33 predicate places. [2023-11-30 03:01:57,280 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 1174 flow [2023-11-30 03:01:57,280 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,280 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:57,280 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:01:57,280 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:01:57,280 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:57,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash -943813050, now seen corresponding path program 1 times [2023-11-30 03:01:57,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:57,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539407490] [2023-11-30 03:01:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:57,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:57,302 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:01:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:57,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539407490] [2023-11-30 03:01:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539407490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:57,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834356417] [2023-11-30 03:01:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:57,303 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:57,303 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 240 [2023-11-30 03:01:57,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 1174 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:57,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 240 [2023-11-30 03:01:57,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:57,414 INFO L124 PetriNetUnfolderBase]: 153/652 cut-off events. [2023-11-30 03:01:57,414 INFO L125 PetriNetUnfolderBase]: For 1535/1997 co-relation queries the response was YES. [2023-11-30 03:01:57,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 652 events. 153/652 cut-off events. For 1535/1997 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2853 event pairs, 39 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 3158. Up to 345 conditions per place. [2023-11-30 03:01:57,420 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 72 selfloop transitions, 7 changer transitions 5/221 dead transitions. [2023-11-30 03:01:57,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 221 transitions, 1977 flow [2023-11-30 03:01:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-30 03:01:57,421 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7722222222222223 [2023-11-30 03:01:57,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:57,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:57,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,424 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -32 predicate places. [2023-11-30 03:01:57,424 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 221 transitions, 1977 flow [2023-11-30 03:01:57,424 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,424 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:57,424 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] [2023-11-30 03:01:57,424 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:01:57,425 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:57,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash -772114722, now seen corresponding path program 1 times [2023-11-30 03:01:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219259] [2023-11-30 03:01:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:57,445 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:01:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219259] [2023-11-30 03:01:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002156958] [2023-11-30 03:01:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:57,446 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:57,447 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 240 [2023-11-30 03:01:57,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 221 transitions, 1977 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:57,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 240 [2023-11-30 03:01:57,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:57,600 INFO L124 PetriNetUnfolderBase]: 211/890 cut-off events. [2023-11-30 03:01:57,600 INFO L125 PetriNetUnfolderBase]: For 2770/3512 co-relation queries the response was YES. [2023-11-30 03:01:57,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 890 events. 211/890 cut-off events. For 2770/3512 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4580 event pairs, 28 based on Foata normal form. 1/845 useless extension candidates. Maximal degree in co-relation 4601. Up to 479 conditions per place. [2023-11-30 03:01:57,608 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 116 selfloop transitions, 10 changer transitions 6/268 dead transitions. [2023-11-30 03:01:57,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 268 transitions, 3215 flow [2023-11-30 03:01:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-30 03:01:57,610 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7722222222222223 [2023-11-30 03:01:57,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:57,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:57,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,613 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -31 predicate places. [2023-11-30 03:01:57,613 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 268 transitions, 3215 flow [2023-11-30 03:01:57,613 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,613 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:57,613 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:57,613 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:01:57,613 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:57,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1027662952, now seen corresponding path program 1 times [2023-11-30 03:01:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357878236] [2023-11-30 03:01:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:57,671 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:01:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357878236] [2023-11-30 03:01:57,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357878236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:57,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:57,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:57,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264932860] [2023-11-30 03:01:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:57,672 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:57,673 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 240 [2023-11-30 03:01:57,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 268 transitions, 3215 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:57,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 240 [2023-11-30 03:01:57,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:57,925 INFO L124 PetriNetUnfolderBase]: 312/1401 cut-off events. [2023-11-30 03:01:57,925 INFO L125 PetriNetUnfolderBase]: For 5713/6594 co-relation queries the response was YES. [2023-11-30 03:01:57,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9317 conditions, 1401 events. 312/1401 cut-off events. For 5713/6594 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8925 event pairs, 17 based on Foata normal form. 1/1331 useless extension candidates. Maximal degree in co-relation 7522. Up to 726 conditions per place. [2023-11-30 03:01:57,936 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 192 selfloop transitions, 29 changer transitions 9/365 dead transitions. [2023-11-30 03:01:57,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 365 transitions, 5875 flow [2023-11-30 03:01:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-30 03:01:57,938 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7722222222222223 [2023-11-30 03:01:57,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:57,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-30 03:01:57,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:57,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,941 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,941 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -30 predicate places. [2023-11-30 03:01:57,941 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 365 transitions, 5875 flow [2023-11-30 03:01:57,941 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,941 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:57,941 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:01:57,941 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:01:57,941 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:57,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -259229451, now seen corresponding path program 1 times [2023-11-30 03:01:57,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:57,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657973572] [2023-11-30 03:01:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:57,966 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:01:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657973572] [2023-11-30 03:01:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657973572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216819747] [2023-11-30 03:01:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:57,967 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:57,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:57,967 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 240 [2023-11-30 03:01:57,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 365 transitions, 5875 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:57,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:57,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 240 [2023-11-30 03:01:57,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:58,299 INFO L124 PetriNetUnfolderBase]: 439/2088 cut-off events. [2023-11-30 03:01:58,299 INFO L125 PetriNetUnfolderBase]: For 11063/12229 co-relation queries the response was YES. [2023-11-30 03:01:58,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14438 conditions, 2088 events. 439/2088 cut-off events. For 11063/12229 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 15570 event pairs, 16 based on Foata normal form. 7/2000 useless extension candidates. Maximal degree in co-relation 11313. Up to 1023 conditions per place. [2023-11-30 03:01:58,323 INFO L140 encePairwiseOnDemand]: 233/240 looper letters, 343 selfloop transitions, 47 changer transitions 12/536 dead transitions. [2023-11-30 03:01:58,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 536 transitions, 10881 flow [2023-11-30 03:01:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-30 03:01:58,325 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7722222222222223 [2023-11-30 03:01:58,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-30 03:01:58,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-30 03:01:58,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:58,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-30 03:01:58,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:01:58,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:58,327 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:58,328 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -29 predicate places. [2023-11-30 03:01:58,328 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 536 transitions, 10881 flow [2023-11-30 03:01:58,328 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:58,328 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:58,328 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:58,328 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:01:58,328 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:01:58,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1962909897, now seen corresponding path program 1 times [2023-11-30 03:01:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177333515] [2023-11-30 03:01:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:58,697 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:01:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177333515] [2023-11-30 03:01:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177333515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:01:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850128156] [2023-11-30 03:01:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:58,700 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:01:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:01:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:01:58,701 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 240 [2023-11-30 03:01:58,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 536 transitions, 10881 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:58,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:58,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 240 [2023-11-30 03:01:58,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:00,852 INFO L124 PetriNetUnfolderBase]: 5527/10138 cut-off events. [2023-11-30 03:02:00,853 INFO L125 PetriNetUnfolderBase]: For 350720/351368 co-relation queries the response was YES. [2023-11-30 03:02:00,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92774 conditions, 10138 events. 5527/10138 cut-off events. For 350720/351368 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 73330 event pairs, 465 based on Foata normal form. 0/10022 useless extension candidates. Maximal degree in co-relation 76160. Up to 6111 conditions per place. [2023-11-30 03:02:00,961 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 1716 selfloop transitions, 4 changer transitions 13/1855 dead transitions. [2023-11-30 03:02:00,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1855 transitions, 48659 flow [2023-11-30 03:02:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:02:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:02:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1046 transitions. [2023-11-30 03:02:00,963 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7263888888888889 [2023-11-30 03:02:00,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1046 transitions. [2023-11-30 03:02:00,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1046 transitions. [2023-11-30 03:02:00,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:00,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1046 transitions. [2023-11-30 03:02:00,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:00,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:00,967 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:00,967 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -25 predicate places. [2023-11-30 03:02:00,968 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 1855 transitions, 48659 flow [2023-11-30 03:02:00,968 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:00,968 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:02:00,968 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] [2023-11-30 03:02:00,968 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:02:00,968 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 93 more)] === [2023-11-30 03:02:00,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:02:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1420768086, now seen corresponding path program 1 times [2023-11-30 03:02:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:02:00,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982613396] [2023-11-30 03:02:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:02:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:02:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:02:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:02:01,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:02:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982613396] [2023-11-30 03:02:01,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982613396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:02:01,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:02:01,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:02:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280952727] [2023-11-30 03:02:01,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:02:01,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:02:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:02:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:02:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:02:01,408 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 240 [2023-11-30 03:02:01,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 1855 transitions, 48659 flow. Second operand has 6 states, 6 states have (on average 160.33333333333334) internal successors, (962), 6 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:01,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:02:01,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 240 [2023-11-30 03:02:01,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:02:05,374 INFO L124 PetriNetUnfolderBase]: 5561/10150 cut-off events. [2023-11-30 03:02:05,375 INFO L125 PetriNetUnfolderBase]: For 354464/354520 co-relation queries the response was YES. [2023-11-30 03:02:05,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101991 conditions, 10150 events. 5561/10150 cut-off events. For 354464/354520 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 73226 event pairs, 478 based on Foata normal form. 0/10103 useless extension candidates. Maximal degree in co-relation 83480. Up to 8250 conditions per place. [2023-11-30 03:02:05,420 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 0 selfloop transitions, 0 changer transitions 2062/2062 dead transitions. [2023-11-30 03:02:05,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 2062 transitions, 58353 flow [2023-11-30 03:02:05,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:02:05,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:02:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1009 transitions. [2023-11-30 03:02:05,423 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7006944444444444 [2023-11-30 03:02:05,423 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1009 transitions. [2023-11-30 03:02:05,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1009 transitions. [2023-11-30 03:02:05,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:02:05,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1009 transitions. [2023-11-30 03:02:05,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:05,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:05,427 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:05,427 INFO L307 CegarLoopForPetriNet]: 219 programPoint places, -21 predicate places. [2023-11-30 03:02:05,428 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 2062 transitions, 58353 flow [2023-11-30 03:02:05,428 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.33333333333334) internal successors, (962), 6 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:02:05,434 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-bakery-2.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:02:05,472 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (96 of 97 remaining) [2023-11-30 03:02:05,472 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (95 of 97 remaining) [2023-11-30 03:02:05,472 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (94 of 97 remaining) [2023-11-30 03:02:05,472 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (93 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (92 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (91 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (90 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (88 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (87 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (86 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (85 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (84 of 97 remaining) [2023-11-30 03:02:05,473 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (83 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (82 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (81 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (80 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (79 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (78 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (77 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (75 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (74 of 97 remaining) [2023-11-30 03:02:05,474 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (73 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (72 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (71 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (70 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (69 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (68 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (64 of 97 remaining) [2023-11-30 03:02:05,475 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (63 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (62 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (61 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (60 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (59 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (58 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (57 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (56 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (55 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 97 remaining) [2023-11-30 03:02:05,476 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (52 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (51 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (50 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (48 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (47 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (45 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (44 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 97 remaining) [2023-11-30 03:02:05,477 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (42 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (38 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (37 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (35 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (34 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (33 of 97 remaining) [2023-11-30 03:02:05,478 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (32 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (31 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (30 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (29 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (27 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (26 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (25 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (24 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (23 of 97 remaining) [2023-11-30 03:02:05,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (22 of 97 remaining) [2023-11-30 03:02:05,480 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (21 of 97 remaining) [2023-11-30 03:02:05,480 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (20 of 97 remaining) [2023-11-30 03:02:05,480 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (19 of 97 remaining) [2023-11-30 03:02:05,480 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (18 of 97 remaining) [2023-11-30 03:02:05,481 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (17 of 97 remaining) [2023-11-30 03:02:05,481 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 97 remaining) [2023-11-30 03:02:05,481 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 97 remaining) [2023-11-30 03:02:05,481 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 97 remaining) [2023-11-30 03:02:05,481 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (12 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (10 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (9 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (8 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (7 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (5 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (4 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (3 of 97 remaining) [2023-11-30 03:02:05,482 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (2 of 97 remaining) [2023-11-30 03:02:05,483 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (1 of 97 remaining) [2023-11-30 03:02:05,483 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (0 of 97 remaining) [2023-11-30 03:02:05,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:02:05,483 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:02:05,490 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:02:05,490 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:02:05,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:02:05 BasicIcfg [2023-11-30 03:02:05,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:02:05,497 INFO L158 Benchmark]: Toolchain (without parser) took 10967.55ms. Allocated memory was 337.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 284.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 611.0MB. Max. memory is 16.0GB. [2023-11-30 03:02:05,497 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 337.6MB. Free memory is still 289.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:02:05,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.22ms. Allocated memory is still 337.6MB. Free memory was 284.2MB in the beginning and 271.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:02:05,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.14ms. Allocated memory is still 337.6MB. Free memory was 271.6MB in the beginning and 269.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:02:05,499 INFO L158 Benchmark]: Boogie Preprocessor took 52.88ms. Allocated memory is still 337.6MB. Free memory was 269.5MB in the beginning and 267.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:02:05,499 INFO L158 Benchmark]: RCFGBuilder took 664.48ms. Allocated memory is still 337.6MB. Free memory was 267.4MB in the beginning and 209.7MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.0GB. [2023-11-30 03:02:05,499 INFO L158 Benchmark]: TraceAbstraction took 10032.70ms. Allocated memory was 337.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 208.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 535.5MB. Max. memory is 16.0GB. [2023-11-30 03:02:05,500 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.09ms. Allocated memory is still 337.6MB. Free memory is still 289.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 177.22ms. Allocated memory is still 337.6MB. Free memory was 284.2MB in the beginning and 271.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.14ms. Allocated memory is still 337.6MB. Free memory was 271.6MB in the beginning and 269.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.88ms. Allocated memory is still 337.6MB. Free memory was 269.5MB in the beginning and 267.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 664.48ms. Allocated memory is still 337.6MB. Free memory was 267.4MB in the beginning and 209.7MB in the end (delta: 57.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.0GB. * TraceAbstraction took 10032.70ms. Allocated memory was 337.6MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 208.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 535.5MB. 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: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 303 locations, 97 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: 9.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1111 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 76 mSDtfsCounter, 1111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58353occurred in iteration=14, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 947 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 933 ConstructedInterpolants, 0 QuantifiedInterpolants, 1119 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 55 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:02:05,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...