/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:17:41,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:17:41,131 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:17:41,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:17:41,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:17:41,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:17:41,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:17:41,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:17:41,155 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:17:41,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:17:41,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:17:41,158 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:17:41,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:17:41,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:17:41,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:17:41,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:17:41,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:17:41,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:17:41,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:17:41,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:17:41,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:17:41,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:17:41,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:17:41,161 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:17:41,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:17:41,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:17:41,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:17:41,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:17:41,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:17:41,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:17:41,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:17:41,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:17:41,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:17:41,163 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:17:41,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:17:41,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:17:41,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:17:41,359 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:17:41,361 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:17:41,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2023-11-30 03:17:42,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:17:42,719 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:17:42,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-fun.wvr.c [2023-11-30 03:17:42,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ea947f8/78c8e17368014cbe96c843da73655c4e/FLAG3d566e22a [2023-11-30 03:17:42,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ea947f8/78c8e17368014cbe96c843da73655c4e [2023-11-30 03:17:42,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:17:42,740 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:17:42,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:17:42,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:17:42,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:17:42,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:42,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4814133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42, skipping insertion in model container [2023-11-30 03:17:42,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:42,763 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:17:42,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:17:42,916 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:17:42,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:17:42,943 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:17:42,943 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:17:42,947 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:17:42,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42 WrapperNode [2023-11-30 03:17:42,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:17:42,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:17:42,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:17:42,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:17:42,953 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:17:42" (1/1) ... [2023-11-30 03:17:42,963 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:17:42" (1/1) ... [2023-11-30 03:17:42,991 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 381 [2023-11-30 03:17:42,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:17:42,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:17:42,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:17:42,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:17:43,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:17:43,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:17:43,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:17:43,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:17:43,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (1/1) ... [2023-11-30 03:17:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:17:43,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:17:43,063 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:17:43,096 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:17:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:17:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:17:43,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:17:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:17:43,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:17:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:17:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:17:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:17:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:17:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:17:43,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:17:43,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:17:43,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:17:43,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:17:43,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:17:43,103 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:17:43,193 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:17:43,194 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:17:43,716 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:17:44,221 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:17:44,221 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 03:17:44,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:17:44 BoogieIcfgContainer [2023-11-30 03:17:44,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:17:44,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:17:44,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:17:44,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:17:44,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:17:42" (1/3) ... [2023-11-30 03:17:44,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71941081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:17:44, skipping insertion in model container [2023-11-30 03:17:44,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:17:42" (2/3) ... [2023-11-30 03:17:44,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71941081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:17:44, skipping insertion in model container [2023-11-30 03:17:44,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:17:44" (3/3) ... [2023-11-30 03:17:44,227 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-fun.wvr.c [2023-11-30 03:17:44,239 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:17:44,239 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2023-11-30 03:17:44,240 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:17:44,337 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:17:44,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 282 transitions, 578 flow [2023-11-30 03:17:44,455 INFO L124 PetriNetUnfolderBase]: 13/280 cut-off events. [2023-11-30 03:17:44,455 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:17:44,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 280 events. 13/280 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 448 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 203. Up to 2 conditions per place. [2023-11-30 03:17:44,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 282 transitions, 578 flow [2023-11-30 03:17:44,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 254 places, 259 transitions, 530 flow [2023-11-30 03:17:44,469 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:17:44,473 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;@222b08f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:17:44,473 INFO L363 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2023-11-30 03:17:44,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:17:44,476 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 03:17:44,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:17:44,476 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:44,477 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:17:44,477 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:44,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1084712688, now seen corresponding path program 1 times [2023-11-30 03:17:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442640090] [2023-11-30 03:17:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:44,592 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:17:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:44,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442640090] [2023-11-30 03:17:44,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442640090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:44,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:44,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124050679] [2023-11-30 03:17:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:44,600 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:44,621 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 282 [2023-11-30 03:17:44,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 259 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:44,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:44,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 282 [2023-11-30 03:17:44,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:44,778 INFO L124 PetriNetUnfolderBase]: 38/332 cut-off events. [2023-11-30 03:17:44,779 INFO L125 PetriNetUnfolderBase]: For 27/47 co-relation queries the response was YES. [2023-11-30 03:17:44,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 332 events. 38/332 cut-off events. For 27/47 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 853 event pairs, 24 based on Foata normal form. 6/292 useless extension candidates. Maximal degree in co-relation 216. Up to 74 conditions per place. [2023-11-30 03:17:44,782 INFO L140 encePairwiseOnDemand]: 231/282 looper letters, 15 selfloop transitions, 2 changer transitions 4/210 dead transitions. [2023-11-30 03:17:44,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 210 transitions, 466 flow [2023-11-30 03:17:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2023-11-30 03:17:44,792 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-30 03:17:44,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2023-11-30 03:17:44,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2023-11-30 03:17:44,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:44,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2023-11-30 03:17:44,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:44,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:44,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:44,805 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -39 predicate places. [2023-11-30 03:17:44,805 INFO L500 AbstractCegarLoop]: Abstraction has has 215 places, 210 transitions, 466 flow [2023-11-30 03:17:44,805 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:44,805 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:44,805 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] [2023-11-30 03:17:44,805 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:17:44,806 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:44,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2144504468, now seen corresponding path program 1 times [2023-11-30 03:17:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093449725] [2023-11-30 03:17:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:44,916 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:17:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093449725] [2023-11-30 03:17:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093449725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333870569] [2023-11-30 03:17:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:44,920 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:44,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:44,922 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 282 [2023-11-30 03:17:44,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 210 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:44,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:44,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 282 [2023-11-30 03:17:44,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:45,056 INFO L124 PetriNetUnfolderBase]: 38/331 cut-off events. [2023-11-30 03:17:45,057 INFO L125 PetriNetUnfolderBase]: For 107/171 co-relation queries the response was YES. [2023-11-30 03:17:45,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 331 events. 38/331 cut-off events. For 107/171 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 853 event pairs, 24 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 232. Up to 74 conditions per place. [2023-11-30 03:17:45,060 INFO L140 encePairwiseOnDemand]: 279/282 looper letters, 12 selfloop transitions, 2 changer transitions 4/209 dead transitions. [2023-11-30 03:17:45,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 492 flow [2023-11-30 03:17:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2023-11-30 03:17:45,062 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7836879432624113 [2023-11-30 03:17:45,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2023-11-30 03:17:45,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2023-11-30 03:17:45,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:45,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2023-11-30 03:17:45,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,067 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -38 predicate places. [2023-11-30 03:17:45,067 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 492 flow [2023-11-30 03:17:45,067 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,067 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:45,068 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] [2023-11-30 03:17:45,068 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:17:45,068 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:45,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1776136406, now seen corresponding path program 1 times [2023-11-30 03:17:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993761807] [2023-11-30 03:17:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:45,197 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:17:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:45,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993761807] [2023-11-30 03:17:45,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993761807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:45,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:45,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:45,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156376908] [2023-11-30 03:17:45,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:45,199 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:45,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:45,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:45,200 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 282 [2023-11-30 03:17:45,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:45,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 282 [2023-11-30 03:17:45,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:45,299 INFO L124 PetriNetUnfolderBase]: 38/330 cut-off events. [2023-11-30 03:17:45,300 INFO L125 PetriNetUnfolderBase]: For 208/282 co-relation queries the response was YES. [2023-11-30 03:17:45,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 330 events. 38/330 cut-off events. For 208/282 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 852 event pairs, 24 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 248. Up to 74 conditions per place. [2023-11-30 03:17:45,302 INFO L140 encePairwiseOnDemand]: 279/282 looper letters, 12 selfloop transitions, 2 changer transitions 4/208 dead transitions. [2023-11-30 03:17:45,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 208 transitions, 518 flow [2023-11-30 03:17:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2023-11-30 03:17:45,304 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7836879432624113 [2023-11-30 03:17:45,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2023-11-30 03:17:45,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2023-11-30 03:17:45,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:45,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2023-11-30 03:17:45,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,308 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -37 predicate places. [2023-11-30 03:17:45,308 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 208 transitions, 518 flow [2023-11-30 03:17:45,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:45,309 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:45,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:17:45,309 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:45,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 315546329, now seen corresponding path program 1 times [2023-11-30 03:17:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:45,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627113735] [2023-11-30 03:17:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:45,344 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:17:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627113735] [2023-11-30 03:17:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627113735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961114617] [2023-11-30 03:17:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:45,345 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:45,346 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 282 [2023-11-30 03:17:45,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 208 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:45,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 282 [2023-11-30 03:17:45,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:45,409 INFO L124 PetriNetUnfolderBase]: 38/329 cut-off events. [2023-11-30 03:17:45,409 INFO L125 PetriNetUnfolderBase]: For 328/412 co-relation queries the response was YES. [2023-11-30 03:17:45,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 329 events. 38/329 cut-off events. For 328/412 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 846 event pairs, 24 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 264. Up to 74 conditions per place. [2023-11-30 03:17:45,411 INFO L140 encePairwiseOnDemand]: 280/282 looper letters, 9 selfloop transitions, 1 changer transitions 4/207 dead transitions. [2023-11-30 03:17:45,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 207 transitions, 534 flow [2023-11-30 03:17:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2023-11-30 03:17:45,412 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.793144208037825 [2023-11-30 03:17:45,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2023-11-30 03:17:45,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2023-11-30 03:17:45,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:45,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2023-11-30 03:17:45,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,416 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -36 predicate places. [2023-11-30 03:17:45,416 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 207 transitions, 534 flow [2023-11-30 03:17:45,417 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,417 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:45,417 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:45,417 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:17:45,417 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:45,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -431706418, now seen corresponding path program 1 times [2023-11-30 03:17:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943723763] [2023-11-30 03:17:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:45,852 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:17:45,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943723763] [2023-11-30 03:17:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943723763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:17:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198708851] [2023-11-30 03:17:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:45,854 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:17:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:17:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:17:45,855 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 282 [2023-11-30 03:17:45,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 207 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:45,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:45,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 282 [2023-11-30 03:17:45,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:46,071 INFO L124 PetriNetUnfolderBase]: 140/510 cut-off events. [2023-11-30 03:17:46,071 INFO L125 PetriNetUnfolderBase]: For 2554/2822 co-relation queries the response was YES. [2023-11-30 03:17:46,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 510 events. 140/510 cut-off events. For 2554/2822 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2078 event pairs, 94 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 1067. Up to 231 conditions per place. [2023-11-30 03:17:46,075 INFO L140 encePairwiseOnDemand]: 270/282 looper letters, 44 selfloop transitions, 10 changer transitions 4/205 dead transitions. [2023-11-30 03:17:46,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 205 transitions, 638 flow [2023-11-30 03:17:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:17:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:17:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1112 transitions. [2023-11-30 03:17:46,078 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6572104018912529 [2023-11-30 03:17:46,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1112 transitions. [2023-11-30 03:17:46,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1112 transitions. [2023-11-30 03:17:46,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:46,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1112 transitions. [2023-11-30 03:17:46,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,083 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,085 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -33 predicate places. [2023-11-30 03:17:46,085 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 205 transitions, 638 flow [2023-11-30 03:17:46,086 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,086 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:46,086 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:46,087 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:17:46,087 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:46,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -693483028, now seen corresponding path program 1 times [2023-11-30 03:17:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507097603] [2023-11-30 03:17:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:46,147 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:17:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507097603] [2023-11-30 03:17:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507097603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996994995] [2023-11-30 03:17:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:46,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:46,154 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 282 [2023-11-30 03:17:46,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 205 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:46,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 282 [2023-11-30 03:17:46,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:46,298 INFO L124 PetriNetUnfolderBase]: 140/509 cut-off events. [2023-11-30 03:17:46,298 INFO L125 PetriNetUnfolderBase]: For 3623/3899 co-relation queries the response was YES. [2023-11-30 03:17:46,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 509 events. 140/509 cut-off events. For 3623/3899 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2055 event pairs, 94 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 1187. Up to 231 conditions per place. [2023-11-30 03:17:46,302 INFO L140 encePairwiseOnDemand]: 279/282 looper letters, 9 selfloop transitions, 2 changer transitions 4/204 dead transitions. [2023-11-30 03:17:46,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 204 transitions, 658 flow [2023-11-30 03:17:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-11-30 03:17:46,304 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7907801418439716 [2023-11-30 03:17:46,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-11-30 03:17:46,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-11-30 03:17:46,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:46,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-11-30 03:17:46,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,309 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -32 predicate places. [2023-11-30 03:17:46,309 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 204 transitions, 658 flow [2023-11-30 03:17:46,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:46,309 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:46,310 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:17:46,310 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:46,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2052484742, now seen corresponding path program 1 times [2023-11-30 03:17:46,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:46,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145589091] [2023-11-30 03:17:46,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:46,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:46,375 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:17:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145589091] [2023-11-30 03:17:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145589091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928564598] [2023-11-30 03:17:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:46,376 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:46,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:46,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:46,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:46,377 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 282 [2023-11-30 03:17:46,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 204 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:46,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 282 [2023-11-30 03:17:46,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:46,489 INFO L124 PetriNetUnfolderBase]: 140/508 cut-off events. [2023-11-30 03:17:46,489 INFO L125 PetriNetUnfolderBase]: For 4748/5026 co-relation queries the response was YES. [2023-11-30 03:17:46,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 508 events. 140/508 cut-off events. For 4748/5026 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2038 event pairs, 94 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 1307. Up to 231 conditions per place. [2023-11-30 03:17:46,492 INFO L140 encePairwiseOnDemand]: 280/282 looper letters, 9 selfloop transitions, 1 changer transitions 4/203 dead transitions. [2023-11-30 03:17:46,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 203 transitions, 674 flow [2023-11-30 03:17:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2023-11-30 03:17:46,493 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.793144208037825 [2023-11-30 03:17:46,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2023-11-30 03:17:46,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2023-11-30 03:17:46,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:46,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2023-11-30 03:17:46,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,496 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -31 predicate places. [2023-11-30 03:17:46,496 INFO L500 AbstractCegarLoop]: Abstraction has has 223 places, 203 transitions, 674 flow [2023-11-30 03:17:46,497 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,497 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:46,497 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:46,497 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:17:46,498 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:46,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash 463569479, now seen corresponding path program 1 times [2023-11-30 03:17:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013229909] [2023-11-30 03:17:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:46,532 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:17:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013229909] [2023-11-30 03:17:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013229909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:46,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294380610] [2023-11-30 03:17:46,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:46,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:46,535 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 282 [2023-11-30 03:17:46,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 203 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:46,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 282 [2023-11-30 03:17:46,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:46,652 INFO L124 PetriNetUnfolderBase]: 140/507 cut-off events. [2023-11-30 03:17:46,652 INFO L125 PetriNetUnfolderBase]: For 5934/6214 co-relation queries the response was YES. [2023-11-30 03:17:46,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 507 events. 140/507 cut-off events. For 5934/6214 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2023 event pairs, 94 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 1427. Up to 231 conditions per place. [2023-11-30 03:17:46,656 INFO L140 encePairwiseOnDemand]: 279/282 looper letters, 9 selfloop transitions, 2 changer transitions 4/202 dead transitions. [2023-11-30 03:17:46,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 202 transitions, 694 flow [2023-11-30 03:17:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-11-30 03:17:46,658 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7907801418439716 [2023-11-30 03:17:46,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-11-30 03:17:46,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-11-30 03:17:46,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:46,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-11-30 03:17:46,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,663 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -30 predicate places. [2023-11-30 03:17:46,663 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 202 transitions, 694 flow [2023-11-30 03:17:46,664 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,665 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:46,665 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:46,665 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:17:46,665 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:46,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1267011244, now seen corresponding path program 1 times [2023-11-30 03:17:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306257634] [2023-11-30 03:17:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:46,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:46,707 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:17:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306257634] [2023-11-30 03:17:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306257634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:46,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:46,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530058198] [2023-11-30 03:17:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:46,709 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:46,710 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 282 [2023-11-30 03:17:46,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 202 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:46,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 282 [2023-11-30 03:17:46,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:46,795 INFO L124 PetriNetUnfolderBase]: 105/431 cut-off events. [2023-11-30 03:17:46,795 INFO L125 PetriNetUnfolderBase]: For 6152/6988 co-relation queries the response was YES. [2023-11-30 03:17:46,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 431 events. 105/431 cut-off events. For 6152/6988 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1518 event pairs, 68 based on Foata normal form. 11/372 useless extension candidates. Maximal degree in co-relation 1216. Up to 191 conditions per place. [2023-11-30 03:17:46,798 INFO L140 encePairwiseOnDemand]: 278/282 looper letters, 13 selfloop transitions, 2 changer transitions 4/203 dead transitions. [2023-11-30 03:17:46,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 203 transitions, 745 flow [2023-11-30 03:17:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2023-11-30 03:17:46,799 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.789598108747045 [2023-11-30 03:17:46,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 668 transitions. [2023-11-30 03:17:46,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 668 transitions. [2023-11-30 03:17:46,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:46,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 668 transitions. [2023-11-30 03:17:46,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,805 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -30 predicate places. [2023-11-30 03:17:46,805 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 203 transitions, 745 flow [2023-11-30 03:17:46,805 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:46,806 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:46,806 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] [2023-11-30 03:17:46,806 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:17:46,806 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:46,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1874369268, now seen corresponding path program 1 times [2023-11-30 03:17:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180036723] [2023-11-30 03:17:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:47,127 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:17:47,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180036723] [2023-11-30 03:17:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180036723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:17:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124918282] [2023-11-30 03:17:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:47,128 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:17:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:47,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:17:47,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:17:47,130 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 282 [2023-11-30 03:17:47,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 203 transitions, 745 flow. Second operand has 6 states, 6 states have (on average 196.83333333333334) internal successors, (1181), 6 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:47,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:47,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 282 [2023-11-30 03:17:47,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:47,542 INFO L124 PetriNetUnfolderBase]: 140/498 cut-off events. [2023-11-30 03:17:47,542 INFO L125 PetriNetUnfolderBase]: For 7652/8701 co-relation queries the response was YES. [2023-11-30 03:17:47,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 498 events. 140/498 cut-off events. For 7652/8701 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1796 event pairs, 24 based on Foata normal form. 11/465 useless extension candidates. Maximal degree in co-relation 1733. Up to 211 conditions per place. [2023-11-30 03:17:47,546 INFO L140 encePairwiseOnDemand]: 277/282 looper letters, 36 selfloop transitions, 4 changer transitions 4/210 dead transitions. [2023-11-30 03:17:47,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 210 transitions, 981 flow [2023-11-30 03:17:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:17:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:17:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2023-11-30 03:17:47,548 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7151300236406619 [2023-11-30 03:17:47,548 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1210 transitions. [2023-11-30 03:17:47,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1210 transitions. [2023-11-30 03:17:47,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:47,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1210 transitions. [2023-11-30 03:17:47,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:47,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:47,552 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:47,552 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -26 predicate places. [2023-11-30 03:17:47,553 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 210 transitions, 981 flow [2023-11-30 03:17:47,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.83333333333334) internal successors, (1181), 6 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:47,553 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:47,553 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:47,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:17:47,553 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:47,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash -660519486, now seen corresponding path program 1 times [2023-11-30 03:17:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231799648] [2023-11-30 03:17:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:47,847 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:17:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:47,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231799648] [2023-11-30 03:17:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231799648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:47,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:17:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150327363] [2023-11-30 03:17:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:47,848 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:17:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:17:47,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:17:47,849 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 282 [2023-11-30 03:17:47,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 210 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:47,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:47,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 282 [2023-11-30 03:17:47,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:48,117 INFO L124 PetriNetUnfolderBase]: 106/438 cut-off events. [2023-11-30 03:17:48,117 INFO L125 PetriNetUnfolderBase]: For 6089/6733 co-relation queries the response was YES. [2023-11-30 03:17:48,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 438 events. 106/438 cut-off events. For 6089/6733 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1559 event pairs, 24 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 1402. Up to 187 conditions per place. [2023-11-30 03:17:48,120 INFO L140 encePairwiseOnDemand]: 277/282 looper letters, 39 selfloop transitions, 4 changer transitions 4/213 dead transitions. [2023-11-30 03:17:48,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 213 transitions, 1149 flow [2023-11-30 03:17:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:17:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:17:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2023-11-30 03:17:48,122 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7121749408983451 [2023-11-30 03:17:48,123 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1205 transitions. [2023-11-30 03:17:48,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1205 transitions. [2023-11-30 03:17:48,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:48,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1205 transitions. [2023-11-30 03:17:48,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,127 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,127 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -22 predicate places. [2023-11-30 03:17:48,127 INFO L500 AbstractCegarLoop]: Abstraction has has 232 places, 213 transitions, 1149 flow [2023-11-30 03:17:48,128 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,128 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:17:48,128 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:48,128 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:17:48,128 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 94 more)] === [2023-11-30 03:17:48,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:17:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2112663758, now seen corresponding path program 1 times [2023-11-30 03:17:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:17:48,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983518566] [2023-11-30 03:17:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:17:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:17:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:17:48,164 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:17:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:17:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983518566] [2023-11-30 03:17:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983518566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:17:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:17:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:17:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90328710] [2023-11-30 03:17:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:17:48,165 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:17:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:17:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:17:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:17:48,166 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 282 [2023-11-30 03:17:48,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 213 transitions, 1149 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:17:48,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 282 [2023-11-30 03:17:48,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:17:48,277 INFO L124 PetriNetUnfolderBase]: 141/496 cut-off events. [2023-11-30 03:17:48,277 INFO L125 PetriNetUnfolderBase]: For 10971/12113 co-relation queries the response was YES. [2023-11-30 03:17:48,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 496 events. 141/496 cut-off events. For 10971/12113 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1808 event pairs, 25 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 2020. Up to 209 conditions per place. [2023-11-30 03:17:48,279 INFO L140 encePairwiseOnDemand]: 280/282 looper letters, 0 selfloop transitions, 0 changer transitions 212/212 dead transitions. [2023-11-30 03:17:48,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 212 transitions, 1187 flow [2023-11-30 03:17:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:17:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:17:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2023-11-30 03:17:48,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8002364066193853 [2023-11-30 03:17:48,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 677 transitions. [2023-11-30 03:17:48,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 677 transitions. [2023-11-30 03:17:48,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:17:48,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 677 transitions. [2023-11-30 03:17:48,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,285 INFO L307 CegarLoopForPetriNet]: 254 programPoint places, -21 predicate places. [2023-11-30 03:17:48,285 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 212 transitions, 1187 flow [2023-11-30 03:17:48,285 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:17:48,294 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-counter-fun.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:17:48,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (97 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (96 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (95 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (94 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (93 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (92 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (91 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (90 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (89 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (88 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (87 of 98 remaining) [2023-11-30 03:17:48,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (86 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (85 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (84 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (83 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (82 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (81 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (79 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (78 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (77 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 98 remaining) [2023-11-30 03:17:48,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (75 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (74 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (73 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (72 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (71 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (70 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (69 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (68 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (67 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (64 of 98 remaining) [2023-11-30 03:17:48,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (63 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (62 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (61 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (60 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (59 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (58 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (57 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (56 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 98 remaining) [2023-11-30 03:17:48,330 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (46 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (45 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (44 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 98 remaining) [2023-11-30 03:17:48,331 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (27 of 98 remaining) [2023-11-30 03:17:48,332 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (26 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (25 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (24 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (23 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (22 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (21 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 98 remaining) [2023-11-30 03:17:48,333 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (12 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (9 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (8 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (7 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (6 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (5 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (4 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (3 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (2 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (1 of 98 remaining) [2023-11-30 03:17:48,334 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (0 of 98 remaining) [2023-11-30 03:17:48,335 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:17:48,335 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:17:48,338 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:17:48,338 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:17:48,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:17:48 BasicIcfg [2023-11-30 03:17:48,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:17:48,343 INFO L158 Benchmark]: Toolchain (without parser) took 5602.86ms. Allocated memory was 461.4MB in the beginning and 843.1MB in the end (delta: 381.7MB). Free memory was 418.3MB in the beginning and 380.6MB in the end (delta: 37.7MB). Peak memory consumption was 417.7MB. Max. memory is 16.0GB. [2023-11-30 03:17:48,343 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 325.1MB. Free memory was 278.2MB in the beginning and 278.1MB in the end (delta: 161.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:17:48,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 461.4MB. Free memory was 418.3MB in the beginning and 405.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:17:48,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.24ms. Allocated memory is still 461.4MB. Free memory was 405.2MB in the beginning and 401.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:17:48,343 INFO L158 Benchmark]: Boogie Preprocessor took 50.47ms. Allocated memory is still 461.4MB. Free memory was 401.3MB in the beginning and 398.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:17:48,344 INFO L158 Benchmark]: RCFGBuilder took 1179.15ms. Allocated memory is still 461.4MB. Free memory was 398.0MB in the beginning and 332.4MB in the end (delta: 65.6MB). Peak memory consumption was 67.4MB. Max. memory is 16.0GB. [2023-11-30 03:17:48,344 INFO L158 Benchmark]: TraceAbstraction took 4118.79ms. Allocated memory was 461.4MB in the beginning and 843.1MB in the end (delta: 381.7MB). Free memory was 331.4MB in the beginning and 380.6MB in the end (delta: -49.2MB). Peak memory consumption was 329.3MB. Max. memory is 16.0GB. [2023-11-30 03:17:48,345 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 325.1MB. Free memory was 278.2MB in the beginning and 278.1MB in the end (delta: 161.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 461.4MB. Free memory was 418.3MB in the beginning and 405.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.24ms. Allocated memory is still 461.4MB. Free memory was 405.2MB in the beginning and 401.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.47ms. Allocated memory is still 461.4MB. Free memory was 401.3MB in the beginning and 398.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1179.15ms. Allocated memory is still 461.4MB. Free memory was 398.0MB in the beginning and 332.4MB in the end (delta: 65.6MB). Peak memory consumption was 67.4MB. Max. memory is 16.0GB. * TraceAbstraction took 4118.79ms. Allocated memory was 461.4MB in the beginning and 843.1MB in the end (delta: 381.7MB). Free memory was 331.4MB in the beginning and 380.6MB in the end (delta: -49.2MB). Peak memory consumption was 329.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 52]: 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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, 340 locations, 98 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: 4.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 363 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 120 mSDtfsCounter, 363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1187occurred in iteration=12, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 1279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:17:48,356 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...