/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/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:01:06,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:01:06,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:01:06,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:01:06,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:01:06,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:01:06,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:01:06,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:01:06,111 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:01:06,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:01:06,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:01:06,111 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:01:06,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:01:06,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:01:06,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:01:06,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:01:06,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:01:06,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:01:06,113 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:01:06,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:01:06,113 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:01:06,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:01:06,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:01:06,114 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:01:06,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:01:06,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:01:06,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:01:06,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:01:06,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:01:06,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:01:06,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:01:06,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:01:06,313 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:01:06,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2023-11-30 03:01:07,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:01:07,424 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:01:07,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2023-11-30 03:01:07,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a0911a3/f57ec036bdb547edbaa622d6caee6a94/FLAG94875f15f [2023-11-30 03:01:07,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52a0911a3/f57ec036bdb547edbaa622d6caee6a94 [2023-11-30 03:01:07,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:01:07,452 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:01:07,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:01:07,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:01:07,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:01:07,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae892b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07, skipping insertion in model container [2023-11-30 03:01:07,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,480 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:01:07,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:01:07,595 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:01:07,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:01:07,629 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:01:07,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07 WrapperNode [2023-11-30 03:01:07,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:01:07,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:01:07,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:01:07,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:01:07,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,661 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 276 [2023-11-30 03:01:07,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:01:07,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:01:07,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:01:07,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:01:07,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:01:07,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:01:07,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:01:07,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:01:07,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (1/1) ... [2023-11-30 03:01:07,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:01:07,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:01:07,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:01:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:01:07,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:01:07,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:01:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:01:07,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:01:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:01:07,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:01:07,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:01:07,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:01:07,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:01:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:01:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:01:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:01:07,782 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:01:07,887 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:01:07,889 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:01:08,271 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:01:08,288 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:01:08,289 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 03:01:08,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:08 BoogieIcfgContainer [2023-11-30 03:01:08,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:01:08,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:01:08,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:01:08,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:01:08,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:01:07" (1/3) ... [2023-11-30 03:01:08,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a950b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:08, skipping insertion in model container [2023-11-30 03:01:08,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:01:07" (2/3) ... [2023-11-30 03:01:08,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a950b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:01:08, skipping insertion in model container [2023-11-30 03:01:08,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:01:08" (3/3) ... [2023-11-30 03:01:08,296 INFO L112 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2023-11-30 03:01:08,307 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:01:08,307 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-30 03:01:08,307 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:01:08,386 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:01:08,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 365 transitions, 744 flow [2023-11-30 03:01:08,512 INFO L124 PetriNetUnfolderBase]: 15/363 cut-off events. [2023-11-30 03:01:08,512 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:01:08,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 363 events. 15/363 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 691 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 221. Up to 2 conditions per place. [2023-11-30 03:01:08,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 365 transitions, 744 flow [2023-11-30 03:01:08,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 342 transitions, 696 flow [2023-11-30 03:01:08,542 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:01:08,548 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;@4a313ec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:01:08,549 INFO L363 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-30 03:01:08,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:01:08,557 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-30 03:01:08,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:01:08,558 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:08,558 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:08,559 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:08,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2098703942, now seen corresponding path program 1 times [2023-11-30 03:01:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156640915] [2023-11-30 03:01:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156640915] [2023-11-30 03:01:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156640915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379450371] [2023-11-30 03:01:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:08,709 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:08,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:08,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:08,750 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 365 [2023-11-30 03:01:08,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 342 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:08,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:08,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 365 [2023-11-30 03:01:08,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:08,875 INFO L124 PetriNetUnfolderBase]: 26/922 cut-off events. [2023-11-30 03:01:08,876 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-30 03:01:08,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 922 events. 26/922 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4640 event pairs, 15 based on Foata normal form. 33/818 useless extension candidates. Maximal degree in co-relation 748. Up to 52 conditions per place. [2023-11-30 03:01:08,884 INFO L140 encePairwiseOnDemand]: 351/365 looper letters, 13 selfloop transitions, 2 changer transitions 1/330 dead transitions. [2023-11-30 03:01:08,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 330 transitions, 702 flow [2023-11-30 03:01:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1032 transitions. [2023-11-30 03:01:08,900 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9424657534246575 [2023-11-30 03:01:08,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1032 transitions. [2023-11-30 03:01:08,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1032 transitions. [2023-11-30 03:01:08,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:08,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1032 transitions. [2023-11-30 03:01:08,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:08,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:08,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:08,921 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 1 predicate places. [2023-11-30 03:01:08,922 INFO L500 AbstractCegarLoop]: Abstraction has has 336 places, 330 transitions, 702 flow [2023-11-30 03:01:08,923 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:08,923 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:08,923 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] [2023-11-30 03:01:08,923 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:01:08,923 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:08,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 328675890, now seen corresponding path program 1 times [2023-11-30 03:01:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324403374] [2023-11-30 03:01:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324403374] [2023-11-30 03:01:09,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324403374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:09,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352865305] [2023-11-30 03:01:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:09,005 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:09,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:09,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:09,008 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 365 [2023-11-30 03:01:09,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 330 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:09,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 365 [2023-11-30 03:01:09,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:09,150 INFO L124 PetriNetUnfolderBase]: 38/933 cut-off events. [2023-11-30 03:01:09,150 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-11-30 03:01:09,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 933 events. 38/933 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4779 event pairs, 27 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 839. Up to 65 conditions per place. [2023-11-30 03:01:09,157 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 22 selfloop transitions, 2 changer transitions 1/329 dead transitions. [2023-11-30 03:01:09,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 329 transitions, 748 flow [2023-11-30 03:01:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1003 transitions. [2023-11-30 03:01:09,159 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9159817351598174 [2023-11-30 03:01:09,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1003 transitions. [2023-11-30 03:01:09,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1003 transitions. [2023-11-30 03:01:09,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:09,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1003 transitions. [2023-11-30 03:01:09,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,165 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:01:09,165 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 329 transitions, 748 flow [2023-11-30 03:01:09,166 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,166 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:09,166 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] [2023-11-30 03:01:09,166 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:01:09,166 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:09,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash -657526493, now seen corresponding path program 1 times [2023-11-30 03:01:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:09,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474715932] [2023-11-30 03:01:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:09,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:09,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474715932] [2023-11-30 03:01:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474715932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:09,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:09,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326214172] [2023-11-30 03:01:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:09,232 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:09,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:09,237 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 365 [2023-11-30 03:01:09,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 329 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:09,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 365 [2023-11-30 03:01:09,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:09,381 INFO L124 PetriNetUnfolderBase]: 47/941 cut-off events. [2023-11-30 03:01:09,382 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-30 03:01:09,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 941 events. 47/941 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4914 event pairs, 36 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 936. Up to 74 conditions per place. [2023-11-30 03:01:09,391 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 19 selfloop transitions, 2 changer transitions 1/328 dead transitions. [2023-11-30 03:01:09,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 328 transitions, 788 flow [2023-11-30 03:01:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2023-11-30 03:01:09,397 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9214611872146119 [2023-11-30 03:01:09,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2023-11-30 03:01:09,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2023-11-30 03:01:09,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:09,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2023-11-30 03:01:09,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,402 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 3 predicate places. [2023-11-30 03:01:09,402 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 328 transitions, 788 flow [2023-11-30 03:01:09,403 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,403 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:09,403 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] [2023-11-30 03:01:09,403 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:01:09,404 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:09,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash -616394469, now seen corresponding path program 1 times [2023-11-30 03:01:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:09,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054866853] [2023-11-30 03:01:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054866853] [2023-11-30 03:01:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054866853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:09,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139445931] [2023-11-30 03:01:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:09,470 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:09,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:09,474 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 365 [2023-11-30 03:01:09,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 328 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:09,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 365 [2023-11-30 03:01:09,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:09,622 INFO L124 PetriNetUnfolderBase]: 50/943 cut-off events. [2023-11-30 03:01:09,622 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2023-11-30 03:01:09,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 943 events. 50/943 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4943 event pairs, 39 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 991. Up to 77 conditions per place. [2023-11-30 03:01:09,626 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 13 selfloop transitions, 2 changer transitions 1/327 dead transitions. [2023-11-30 03:01:09,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 327 transitions, 816 flow [2023-11-30 03:01:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2023-11-30 03:01:09,628 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9324200913242009 [2023-11-30 03:01:09,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1021 transitions. [2023-11-30 03:01:09,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1021 transitions. [2023-11-30 03:01:09,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:09,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1021 transitions. [2023-11-30 03:01:09,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,634 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 4 predicate places. [2023-11-30 03:01:09,634 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 327 transitions, 816 flow [2023-11-30 03:01:09,634 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,634 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:09,635 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:09,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:01:09,635 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:09,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 383610033, now seen corresponding path program 1 times [2023-11-30 03:01:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968673002] [2023-11-30 03:01:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968673002] [2023-11-30 03:01:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968673002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:09,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:09,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498918225] [2023-11-30 03:01:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:09,686 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:09,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:09,687 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 365 [2023-11-30 03:01:09,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 327 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:09,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 365 [2023-11-30 03:01:09,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:09,794 INFO L124 PetriNetUnfolderBase]: 62/954 cut-off events. [2023-11-30 03:01:09,794 INFO L125 PetriNetUnfolderBase]: For 2437/3012 co-relation queries the response was YES. [2023-11-30 03:01:09,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 954 events. 62/954 cut-off events. For 2437/3012 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5398 event pairs, 51 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 1067. Up to 113 conditions per place. [2023-11-30 03:01:09,800 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 22 selfloop transitions, 2 changer transitions 1/326 dead transitions. [2023-11-30 03:01:09,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 326 transitions, 862 flow [2023-11-30 03:01:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1003 transitions. [2023-11-30 03:01:09,802 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9159817351598174 [2023-11-30 03:01:09,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1003 transitions. [2023-11-30 03:01:09,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1003 transitions. [2023-11-30 03:01:09,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:09,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1003 transitions. [2023-11-30 03:01:09,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,808 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 5 predicate places. [2023-11-30 03:01:09,808 INFO L500 AbstractCegarLoop]: Abstraction has has 340 places, 326 transitions, 862 flow [2023-11-30 03:01:09,809 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,809 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:09,809 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] [2023-11-30 03:01:09,809 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:01:09,809 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:09,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash -351778937, now seen corresponding path program 1 times [2023-11-30 03:01:09,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:09,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131034711] [2023-11-30 03:01:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:09,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131034711] [2023-11-30 03:01:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131034711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835613880] [2023-11-30 03:01:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:09,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:09,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:09,850 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 365 [2023-11-30 03:01:09,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 326 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:09,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 365 [2023-11-30 03:01:09,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:09,951 INFO L124 PetriNetUnfolderBase]: 71/962 cut-off events. [2023-11-30 03:01:09,951 INFO L125 PetriNetUnfolderBase]: For 8142/9767 co-relation queries the response was YES. [2023-11-30 03:01:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 962 events. 71/962 cut-off events. For 8142/9767 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5695 event pairs, 60 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1131. Up to 122 conditions per place. [2023-11-30 03:01:09,962 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 19 selfloop transitions, 2 changer transitions 1/325 dead transitions. [2023-11-30 03:01:09,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 325 transitions, 902 flow [2023-11-30 03:01:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2023-11-30 03:01:09,964 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9214611872146119 [2023-11-30 03:01:09,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2023-11-30 03:01:09,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2023-11-30 03:01:09,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:09,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2023-11-30 03:01:09,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,970 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2023-11-30 03:01:09,971 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 325 transitions, 902 flow [2023-11-30 03:01:09,971 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:09,972 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:09,972 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:09,972 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:01:09,972 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:09,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 497001869, now seen corresponding path program 1 times [2023-11-30 03:01:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148729698] [2023-11-30 03:01:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:10,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148729698] [2023-11-30 03:01:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148729698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567910304] [2023-11-30 03:01:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:10,019 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:10,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:10,020 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 365 [2023-11-30 03:01:10,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 325 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:10,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 365 [2023-11-30 03:01:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:10,114 INFO L124 PetriNetUnfolderBase]: 74/964 cut-off events. [2023-11-30 03:01:10,115 INFO L125 PetriNetUnfolderBase]: For 11342/13000 co-relation queries the response was YES. [2023-11-30 03:01:10,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 964 events. 74/964 cut-off events. For 11342/13000 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5785 event pairs, 63 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1171. Up to 125 conditions per place. [2023-11-30 03:01:10,121 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 12 selfloop transitions, 2 changer transitions 1/324 dead transitions. [2023-11-30 03:01:10,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 324 transitions, 928 flow [2023-11-30 03:01:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2023-11-30 03:01:10,123 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2023-11-30 03:01:10,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1020 transitions. [2023-11-30 03:01:10,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1020 transitions. [2023-11-30 03:01:10,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:10,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1020 transitions. [2023-11-30 03:01:10,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,127 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 7 predicate places. [2023-11-30 03:01:10,127 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 324 transitions, 928 flow [2023-11-30 03:01:10,128 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,128 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:10,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] [2023-11-30 03:01:10,128 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:01:10,128 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:10,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1407999484, now seen corresponding path program 1 times [2023-11-30 03:01:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952751062] [2023-11-30 03:01:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952751062] [2023-11-30 03:01:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952751062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:10,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:10,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45512182] [2023-11-30 03:01:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:10,169 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:10,171 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 365 [2023-11-30 03:01:10,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 324 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:10,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 365 [2023-11-30 03:01:10,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:10,283 INFO L124 PetriNetUnfolderBase]: 71/951 cut-off events. [2023-11-30 03:01:10,283 INFO L125 PetriNetUnfolderBase]: For 9112/12303 co-relation queries the response was YES. [2023-11-30 03:01:10,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 951 events. 71/951 cut-off events. For 9112/12303 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5654 event pairs, 57 based on Foata normal form. 12/830 useless extension candidates. Maximal degree in co-relation 1190. Up to 122 conditions per place. [2023-11-30 03:01:10,289 INFO L140 encePairwiseOnDemand]: 358/365 looper letters, 15 selfloop transitions, 3 changer transitions 1/321 dead transitions. [2023-11-30 03:01:10,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 321 transitions, 967 flow [2023-11-30 03:01:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2023-11-30 03:01:10,292 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9242009132420091 [2023-11-30 03:01:10,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2023-11-30 03:01:10,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2023-11-30 03:01:10,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:10,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2023-11-30 03:01:10,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,295 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,297 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 5 predicate places. [2023-11-30 03:01:10,297 INFO L500 AbstractCegarLoop]: Abstraction has has 340 places, 321 transitions, 967 flow [2023-11-30 03:01:10,297 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,298 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:10,298 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:10,300 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:01:10,300 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:10,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 172831304, now seen corresponding path program 1 times [2023-11-30 03:01:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826088125] [2023-11-30 03:01:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826088125] [2023-11-30 03:01:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826088125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062775384] [2023-11-30 03:01:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:10,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:10,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:10,356 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 365 [2023-11-30 03:01:10,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 321 transitions, 967 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:10,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 365 [2023-11-30 03:01:10,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:10,480 INFO L124 PetriNetUnfolderBase]: 68/932 cut-off events. [2023-11-30 03:01:10,480 INFO L125 PetriNetUnfolderBase]: For 9764/12145 co-relation queries the response was YES. [2023-11-30 03:01:10,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 932 events. 68/932 cut-off events. For 9764/12145 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5427 event pairs, 51 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1212. Up to 104 conditions per place. [2023-11-30 03:01:10,485 INFO L140 encePairwiseOnDemand]: 358/365 looper letters, 16 selfloop transitions, 3 changer transitions 1/318 dead transitions. [2023-11-30 03:01:10,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 318 transitions, 1010 flow [2023-11-30 03:01:10,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2023-11-30 03:01:10,487 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9242009132420091 [2023-11-30 03:01:10,487 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2023-11-30 03:01:10,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2023-11-30 03:01:10,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:10,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2023-11-30 03:01:10,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,492 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 3 predicate places. [2023-11-30 03:01:10,492 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 318 transitions, 1010 flow [2023-11-30 03:01:10,492 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,493 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:10,493 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:10,493 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:01:10,493 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:10,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash -508053435, now seen corresponding path program 1 times [2023-11-30 03:01:10,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117147739] [2023-11-30 03:01:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117147739] [2023-11-30 03:01:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117147739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609995522] [2023-11-30 03:01:10,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:10,525 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:10,527 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2023-11-30 03:01:10,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 318 transitions, 1010 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:10,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2023-11-30 03:01:10,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:10,660 INFO L124 PetriNetUnfolderBase]: 116/1534 cut-off events. [2023-11-30 03:01:10,660 INFO L125 PetriNetUnfolderBase]: For 17447/20823 co-relation queries the response was YES. [2023-11-30 03:01:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3133 conditions, 1534 events. 116/1534 cut-off events. For 17447/20823 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11296 event pairs, 83 based on Foata normal form. 11/1351 useless extension candidates. Maximal degree in co-relation 1231. Up to 185 conditions per place. [2023-11-30 03:01:10,670 INFO L140 encePairwiseOnDemand]: 359/365 looper letters, 20 selfloop transitions, 3 changer transitions 1/321 dead transitions. [2023-11-30 03:01:10,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 321 transitions, 1163 flow [2023-11-30 03:01:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2023-11-30 03:01:10,672 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-30 03:01:10,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1022 transitions. [2023-11-30 03:01:10,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1022 transitions. [2023-11-30 03:01:10,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:10,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1022 transitions. [2023-11-30 03:01:10,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,676 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:01:10,676 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 321 transitions, 1163 flow [2023-11-30 03:01:10,676 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,676 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:10,677 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:10,677 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:01:10,677 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:10,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1386938343, now seen corresponding path program 1 times [2023-11-30 03:01:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:10,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513732972] [2023-11-30 03:01:10,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513732972] [2023-11-30 03:01:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513732972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:10,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:10,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:10,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570624779] [2023-11-30 03:01:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:10,695 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:10,696 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 365 [2023-11-30 03:01:10,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 321 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:10,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 365 [2023-11-30 03:01:10,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:10,887 INFO L124 PetriNetUnfolderBase]: 179/2034 cut-off events. [2023-11-30 03:01:10,887 INFO L125 PetriNetUnfolderBase]: For 39276/47976 co-relation queries the response was YES. [2023-11-30 03:01:10,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 2034 events. 179/2034 cut-off events. For 39276/47976 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15686 event pairs, 104 based on Foata normal form. 23/1813 useless extension candidates. Maximal degree in co-relation 1939. Up to 261 conditions per place. [2023-11-30 03:01:10,904 INFO L140 encePairwiseOnDemand]: 359/365 looper letters, 27 selfloop transitions, 3 changer transitions 1/326 dead transitions. [2023-11-30 03:01:10,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 326 transitions, 1390 flow [2023-11-30 03:01:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2023-11-30 03:01:10,906 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-30 03:01:10,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1022 transitions. [2023-11-30 03:01:10,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1022 transitions. [2023-11-30 03:01:10,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:10,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1022 transitions. [2023-11-30 03:01:10,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,909 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 1 predicate places. [2023-11-30 03:01:10,910 INFO L500 AbstractCegarLoop]: Abstraction has has 336 places, 326 transitions, 1390 flow [2023-11-30 03:01:10,910 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,910 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:10,910 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] [2023-11-30 03:01:10,910 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:01:10,910 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:10,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash 807655191, now seen corresponding path program 1 times [2023-11-30 03:01:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925831181] [2023-11-30 03:01:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:10,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925831181] [2023-11-30 03:01:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925831181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437634732] [2023-11-30 03:01:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:10,934 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:10,935 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 365 [2023-11-30 03:01:10,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 326 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:10,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:10,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 365 [2023-11-30 03:01:10,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:11,168 INFO L124 PetriNetUnfolderBase]: 147/1790 cut-off events. [2023-11-30 03:01:11,168 INFO L125 PetriNetUnfolderBase]: For 49858/58231 co-relation queries the response was YES. [2023-11-30 03:01:11,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 1790 events. 147/1790 cut-off events. For 49858/58231 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13266 event pairs, 71 based on Foata normal form. 22/1630 useless extension candidates. Maximal degree in co-relation 1566. Up to 228 conditions per place. [2023-11-30 03:01:11,204 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 26 selfloop transitions, 2 changer transitions 1/328 dead transitions. [2023-11-30 03:01:11,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 328 transitions, 1500 flow [2023-11-30 03:01:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1032 transitions. [2023-11-30 03:01:11,212 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9424657534246575 [2023-11-30 03:01:11,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1032 transitions. [2023-11-30 03:01:11,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1032 transitions. [2023-11-30 03:01:11,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:11,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1032 transitions. [2023-11-30 03:01:11,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,219 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 1 predicate places. [2023-11-30 03:01:11,219 INFO L500 AbstractCegarLoop]: Abstraction has has 336 places, 328 transitions, 1500 flow [2023-11-30 03:01:11,220 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,220 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:11,220 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] [2023-11-30 03:01:11,220 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:01:11,240 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:11,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 890381982, now seen corresponding path program 1 times [2023-11-30 03:01:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811630689] [2023-11-30 03:01:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811630689] [2023-11-30 03:01:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811630689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900929506] [2023-11-30 03:01:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:11,267 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:11,269 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 365 [2023-11-30 03:01:11,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 328 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:11,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 365 [2023-11-30 03:01:11,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:11,538 INFO L124 PetriNetUnfolderBase]: 150/1774 cut-off events. [2023-11-30 03:01:11,538 INFO L125 PetriNetUnfolderBase]: For 59947/69944 co-relation queries the response was YES. [2023-11-30 03:01:11,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4476 conditions, 1774 events. 150/1774 cut-off events. For 59947/69944 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13130 event pairs, 59 based on Foata normal form. 73/1676 useless extension candidates. Maximal degree in co-relation 1641. Up to 231 conditions per place. [2023-11-30 03:01:11,563 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 30 selfloop transitions, 2 changer transitions 1/330 dead transitions. [2023-11-30 03:01:11,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 330 transitions, 1647 flow [2023-11-30 03:01:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2023-11-30 03:01:11,566 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.936986301369863 [2023-11-30 03:01:11,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1026 transitions. [2023-11-30 03:01:11,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1026 transitions. [2023-11-30 03:01:11,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:11,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1026 transitions. [2023-11-30 03:01:11,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,571 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:01:11,571 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 330 transitions, 1647 flow [2023-11-30 03:01:11,571 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,571 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:11,571 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:11,572 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:01:11,572 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:11,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1998991450, now seen corresponding path program 1 times [2023-11-30 03:01:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:11,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521060943] [2023-11-30 03:01:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:11,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521060943] [2023-11-30 03:01:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521060943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:11,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:11,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:01:11,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691765226] [2023-11-30 03:01:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:11,928 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:01:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:11,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:01:11,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:01:11,930 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 365 [2023-11-30 03:01:11,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 330 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 330.8333333333333) internal successors, (1985), 6 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:11,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:11,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 365 [2023-11-30 03:01:11,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:12,182 INFO L124 PetriNetUnfolderBase]: 150/1771 cut-off events. [2023-11-30 03:01:12,182 INFO L125 PetriNetUnfolderBase]: For 380185/439482 co-relation queries the response was YES. [2023-11-30 03:01:12,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 1771 events. 150/1771 cut-off events. For 380185/439482 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13100 event pairs, 59 based on Foata normal form. 254/1857 useless extension candidates. Maximal degree in co-relation 1684. Up to 231 conditions per place. [2023-11-30 03:01:12,194 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 34 selfloop transitions, 4 changer transitions 1/329 dead transitions. [2023-11-30 03:01:12,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 329 transitions, 1721 flow [2023-11-30 03:01:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:01:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:01:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1994 transitions. [2023-11-30 03:01:12,197 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9105022831050228 [2023-11-30 03:01:12,197 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1994 transitions. [2023-11-30 03:01:12,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1994 transitions. [2023-11-30 03:01:12,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:12,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1994 transitions. [2023-11-30 03:01:12,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 332.3333333333333) internal successors, (1994), 6 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 365.0) internal successors, (2555), 7 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 365.0) internal successors, (2555), 7 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,204 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2023-11-30 03:01:12,204 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 329 transitions, 1721 flow [2023-11-30 03:01:12,204 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 330.8333333333333) internal successors, (1985), 6 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,204 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:12,204 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:12,204 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:01:12,204 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:12,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1903433278, now seen corresponding path program 1 times [2023-11-30 03:01:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318859804] [2023-11-30 03:01:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:12,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:12,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318859804] [2023-11-30 03:01:12,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318859804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:12,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:12,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811206598] [2023-11-30 03:01:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:12,231 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:12,232 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 365 [2023-11-30 03:01:12,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 329 transitions, 1721 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:12,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 365 [2023-11-30 03:01:12,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:12,432 INFO L124 PetriNetUnfolderBase]: 154/1759 cut-off events. [2023-11-30 03:01:12,432 INFO L125 PetriNetUnfolderBase]: For 152919/170812 co-relation queries the response was YES. [2023-11-30 03:01:12,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4888 conditions, 1759 events. 154/1759 cut-off events. For 152919/170812 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13006 event pairs, 53 based on Foata normal form. 24/1630 useless extension candidates. Maximal degree in co-relation 1959. Up to 235 conditions per place. [2023-11-30 03:01:12,448 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 33 selfloop transitions, 2 changer transitions 1/332 dead transitions. [2023-11-30 03:01:12,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 332 transitions, 1919 flow [2023-11-30 03:01:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2023-11-30 03:01:12,451 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9360730593607306 [2023-11-30 03:01:12,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1025 transitions. [2023-11-30 03:01:12,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1025 transitions. [2023-11-30 03:01:12,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:12,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1025 transitions. [2023-11-30 03:01:12,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.6666666666667) internal successors, (1025), 3 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,455 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 7 predicate places. [2023-11-30 03:01:12,455 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 332 transitions, 1919 flow [2023-11-30 03:01:12,455 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,455 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:12,455 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] [2023-11-30 03:01:12,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:01:12,456 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:12,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1597877149, now seen corresponding path program 1 times [2023-11-30 03:01:12,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:12,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934139036] [2023-11-30 03:01:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:12,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:12,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934139036] [2023-11-30 03:01:12,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934139036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:12,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:12,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843954208] [2023-11-30 03:01:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:12,490 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:12,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:12,491 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 365 [2023-11-30 03:01:12,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 332 transitions, 1919 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 365 [2023-11-30 03:01:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:12,683 INFO L124 PetriNetUnfolderBase]: 156/1746 cut-off events. [2023-11-30 03:01:12,683 INFO L125 PetriNetUnfolderBase]: For 132375/159046 co-relation queries the response was YES. [2023-11-30 03:01:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5101 conditions, 1746 events. 156/1746 cut-off events. For 132375/159046 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12848 event pairs, 43 based on Foata normal form. 77/1677 useless extension candidates. Maximal degree in co-relation 2025. Up to 237 conditions per place. [2023-11-30 03:01:12,698 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 41 selfloop transitions, 2 changer transitions 1/333 dead transitions. [2023-11-30 03:01:12,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 333 transitions, 2069 flow [2023-11-30 03:01:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2023-11-30 03:01:12,700 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9168949771689497 [2023-11-30 03:01:12,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1004 transitions. [2023-11-30 03:01:12,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1004 transitions. [2023-11-30 03:01:12,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:12,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1004 transitions. [2023-11-30 03:01:12,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,704 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 8 predicate places. [2023-11-30 03:01:12,704 INFO L500 AbstractCegarLoop]: Abstraction has has 343 places, 333 transitions, 2069 flow [2023-11-30 03:01:12,704 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:12,704 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:12,704 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] [2023-11-30 03:01:12,704 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:01:12,704 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:12,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1303026559, now seen corresponding path program 1 times [2023-11-30 03:01:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:12,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141417253] [2023-11-30 03:01:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141417253] [2023-11-30 03:01:13,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141417253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:01:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619720142] [2023-11-30 03:01:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:13,121 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:01:13,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:01:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:01:13,122 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 365 [2023-11-30 03:01:13,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 333 transitions, 2069 flow. Second operand has 6 states, 6 states have (on average 331.8333333333333) internal successors, (1991), 6 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:13,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 365 [2023-11-30 03:01:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:13,366 INFO L124 PetriNetUnfolderBase]: 156/1759 cut-off events. [2023-11-30 03:01:13,366 INFO L125 PetriNetUnfolderBase]: For 179451/209232 co-relation queries the response was YES. [2023-11-30 03:01:13,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5310 conditions, 1759 events. 156/1759 cut-off events. For 179451/209232 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12929 event pairs, 67 based on Foata normal form. 40/1657 useless extension candidates. Maximal degree in co-relation 1907. Up to 237 conditions per place. [2023-11-30 03:01:13,385 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 39 selfloop transitions, 4 changer transitions 1/332 dead transitions. [2023-11-30 03:01:13,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 332 transitions, 2151 flow [2023-11-30 03:01:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:01:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:01:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2023-11-30 03:01:13,389 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9100456621004567 [2023-11-30 03:01:13,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1993 transitions. [2023-11-30 03:01:13,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1993 transitions. [2023-11-30 03:01:13,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:13,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1993 transitions. [2023-11-30 03:01:13,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 332.1666666666667) internal successors, (1993), 6 states have internal predecessors, (1993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 365.0) internal successors, (2555), 7 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 365.0) internal successors, (2555), 7 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,395 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 12 predicate places. [2023-11-30 03:01:13,395 INFO L500 AbstractCegarLoop]: Abstraction has has 347 places, 332 transitions, 2151 flow [2023-11-30 03:01:13,396 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 331.8333333333333) internal successors, (1991), 6 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,396 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:13,396 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] [2023-11-30 03:01:13,396 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:01:13,396 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:13,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1675964996, now seen corresponding path program 1 times [2023-11-30 03:01:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726384469] [2023-11-30 03:01:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726384469] [2023-11-30 03:01:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726384469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576583938] [2023-11-30 03:01:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:13,426 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:13,428 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 365 [2023-11-30 03:01:13,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 332 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:13,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 365 [2023-11-30 03:01:13,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:13,644 INFO L124 PetriNetUnfolderBase]: 158/1743 cut-off events. [2023-11-30 03:01:13,644 INFO L125 PetriNetUnfolderBase]: For 217375/248888 co-relation queries the response was YES. [2023-11-30 03:01:13,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5549 conditions, 1743 events. 158/1743 cut-off events. For 217375/248888 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12881 event pairs, 54 based on Foata normal form. 25/1635 useless extension candidates. Maximal degree in co-relation 2210. Up to 231 conditions per place. [2023-11-30 03:01:13,666 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 43 selfloop transitions, 2 changer transitions 1/333 dead transitions. [2023-11-30 03:01:13,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 333 transitions, 2313 flow [2023-11-30 03:01:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2023-11-30 03:01:13,668 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9168949771689497 [2023-11-30 03:01:13,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1004 transitions. [2023-11-30 03:01:13,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1004 transitions. [2023-11-30 03:01:13,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:13,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1004 transitions. [2023-11-30 03:01:13,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,672 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 13 predicate places. [2023-11-30 03:01:13,672 INFO L500 AbstractCegarLoop]: Abstraction has has 348 places, 333 transitions, 2313 flow [2023-11-30 03:01:13,672 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,672 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:13,672 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] [2023-11-30 03:01:13,672 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:01:13,672 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:13,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 748126945, now seen corresponding path program 1 times [2023-11-30 03:01:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:13,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998018472] [2023-11-30 03:01:13,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998018472] [2023-11-30 03:01:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998018472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714189218] [2023-11-30 03:01:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:13,711 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:13,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:13,712 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 365 [2023-11-30 03:01:13,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 333 transitions, 2313 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:13,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 365 [2023-11-30 03:01:13,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:13,955 INFO L124 PetriNetUnfolderBase]: 158/1739 cut-off events. [2023-11-30 03:01:13,955 INFO L125 PetriNetUnfolderBase]: For 265839/304160 co-relation queries the response was YES. [2023-11-30 03:01:13,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 1739 events. 158/1739 cut-off events. For 265839/304160 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12903 event pairs, 54 based on Foata normal form. 25/1635 useless extension candidates. Maximal degree in co-relation 2263. Up to 231 conditions per place. [2023-11-30 03:01:13,969 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 36 selfloop transitions, 1 changer transitions 1/332 dead transitions. [2023-11-30 03:01:13,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 332 transitions, 2381 flow [2023-11-30 03:01:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2023-11-30 03:01:13,971 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9388127853881278 [2023-11-30 03:01:13,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2023-11-30 03:01:13,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2023-11-30 03:01:13,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:13,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2023-11-30 03:01:13,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,974 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 14 predicate places. [2023-11-30 03:01:13,974 INFO L500 AbstractCegarLoop]: Abstraction has has 349 places, 332 transitions, 2381 flow [2023-11-30 03:01:13,974 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:13,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:13,975 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:13,975 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:01:13,975 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:13,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1469671238, now seen corresponding path program 1 times [2023-11-30 03:01:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568531689] [2023-11-30 03:01:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568531689] [2023-11-30 03:01:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568531689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847950264] [2023-11-30 03:01:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:14,008 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:14,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:14,009 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 365 [2023-11-30 03:01:14,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 332 transitions, 2381 flow. Second operand has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:14,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 365 [2023-11-30 03:01:14,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:14,228 INFO L124 PetriNetUnfolderBase]: 158/1736 cut-off events. [2023-11-30 03:01:14,228 INFO L125 PetriNetUnfolderBase]: For 324165/362790 co-relation queries the response was YES. [2023-11-30 03:01:14,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5860 conditions, 1736 events. 158/1736 cut-off events. For 324165/362790 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12901 event pairs, 58 based on Foata normal form. 29/1636 useless extension candidates. Maximal degree in co-relation 2132. Up to 231 conditions per place. [2023-11-30 03:01:14,244 INFO L140 encePairwiseOnDemand]: 363/365 looper letters, 27 selfloop transitions, 0 changer transitions 13/331 dead transitions. [2023-11-30 03:01:14,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 331 transitions, 2447 flow [2023-11-30 03:01:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2023-11-30 03:01:14,247 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9378995433789954 [2023-11-30 03:01:14,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1027 transitions. [2023-11-30 03:01:14,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1027 transitions. [2023-11-30 03:01:14,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:14,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1027 transitions. [2023-11-30 03:01:14,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,250 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 15 predicate places. [2023-11-30 03:01:14,250 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 331 transitions, 2447 flow [2023-11-30 03:01:14,250 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.3333333333333) internal successors, (1027), 3 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,250 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:14,250 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:14,250 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 03:01:14,250 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:14,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -648689320, now seen corresponding path program 1 times [2023-11-30 03:01:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031082689] [2023-11-30 03:01:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031082689] [2023-11-30 03:01:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031082689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861853721] [2023-11-30 03:01:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:14,283 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:14,284 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 365 [2023-11-30 03:01:14,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 331 transitions, 2447 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:14,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 365 [2023-11-30 03:01:14,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:14,566 INFO L124 PetriNetUnfolderBase]: 160/1722 cut-off events. [2023-11-30 03:01:14,566 INFO L125 PetriNetUnfolderBase]: For 358635/418128 co-relation queries the response was YES. [2023-11-30 03:01:14,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6058 conditions, 1722 events. 160/1722 cut-off events. For 358635/418128 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12755 event pairs, 44 based on Foata normal form. 57/1657 useless extension candidates. Maximal degree in co-relation 2387. Up to 233 conditions per place. [2023-11-30 03:01:14,584 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 36 selfloop transitions, 2 changer transitions 13/332 dead transitions. [2023-11-30 03:01:14,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 332 transitions, 2623 flow [2023-11-30 03:01:14,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2023-11-30 03:01:14,586 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9232876712328767 [2023-11-30 03:01:14,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2023-11-30 03:01:14,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2023-11-30 03:01:14,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:14,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2023-11-30 03:01:14,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,590 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 16 predicate places. [2023-11-30 03:01:14,590 INFO L500 AbstractCegarLoop]: Abstraction has has 351 places, 332 transitions, 2623 flow [2023-11-30 03:01:14,590 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,590 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:01:14,590 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:14,590 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 03:01:14,590 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-30 03:01:14,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:01:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash -93131463, now seen corresponding path program 1 times [2023-11-30 03:01:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:01:14,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832077322] [2023-11-30 03:01:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:01:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:01:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:01:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:01:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:01:14,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832077322] [2023-11-30 03:01:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832077322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:01:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:01:14,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:01:14,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587032320] [2023-11-30 03:01:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:01:14,620 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:01:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:01:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:01:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:01:14,621 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 365 [2023-11-30 03:01:14,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 332 transitions, 2623 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:01:14,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 365 [2023-11-30 03:01:14,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:01:14,969 INFO L124 PetriNetUnfolderBase]: 162/1726 cut-off events. [2023-11-30 03:01:14,969 INFO L125 PetriNetUnfolderBase]: For 427364/485537 co-relation queries the response was YES. [2023-11-30 03:01:14,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6314 conditions, 1726 events. 162/1726 cut-off events. For 427364/485537 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12795 event pairs, 58 based on Foata normal form. 27/1638 useless extension candidates. Maximal degree in co-relation 2279. Up to 235 conditions per place. [2023-11-30 03:01:14,984 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 0 selfloop transitions, 0 changer transitions 333/333 dead transitions. [2023-11-30 03:01:14,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 333 transitions, 2807 flow [2023-11-30 03:01:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:01:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:01:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2023-11-30 03:01:14,986 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9232876712328767 [2023-11-30 03:01:14,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2023-11-30 03:01:14,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2023-11-30 03:01:14,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:01:14,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2023-11-30 03:01:14,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 365.0) internal successors, (1460), 4 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,990 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 17 predicate places. [2023-11-30 03:01:14,990 INFO L500 AbstractCegarLoop]: Abstraction has has 352 places, 333 transitions, 2807 flow [2023-11-30 03:01:14,990 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:01:14,999 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/fibonacci.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:01:15,066 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (52 of 53 remaining) [2023-11-30 03:01:15,067 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2023-11-30 03:01:15,067 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2023-11-30 03:01:15,067 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2023-11-30 03:01:15,067 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2023-11-30 03:01:15,067 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2023-11-30 03:01:15,067 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2023-11-30 03:01:15,068 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2023-11-30 03:01:15,069 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2023-11-30 03:01:15,070 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2023-11-30 03:01:15,071 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2023-11-30 03:01:15,071 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 03:01:15,072 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:01:15,077 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:01:15,077 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:01:15,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:01:15 BasicIcfg [2023-11-30 03:01:15,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:01:15,082 INFO L158 Benchmark]: Toolchain (without parser) took 7630.52ms. Allocated memory was 591.4MB in the beginning and 1.3GB in the end (delta: 679.5MB). Free memory was 550.8MB in the beginning and 1.0GB in the end (delta: -490.8MB). Peak memory consumption was 504.2MB. Max. memory is 16.0GB. [2023-11-30 03:01:15,084 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 354.4MB. Free memory is still 307.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:01:15,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.60ms. Allocated memory is still 591.4MB. Free memory was 550.8MB in the beginning and 538.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:01:15,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.08ms. Allocated memory is still 591.4MB. Free memory was 538.7MB in the beginning and 536.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:01:15,084 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 591.4MB. Free memory was 536.2MB in the beginning and 534.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:01:15,085 INFO L158 Benchmark]: RCFGBuilder took 592.99ms. Allocated memory is still 591.4MB. Free memory was 534.1MB in the beginning and 508.7MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 03:01:15,085 INFO L158 Benchmark]: TraceAbstraction took 6790.36ms. Allocated memory was 591.4MB in the beginning and 1.3GB in the end (delta: 679.5MB). Free memory was 507.8MB in the beginning and 1.0GB in the end (delta: -533.8MB). Peak memory consumption was 460.1MB. Max. memory is 16.0GB. [2023-11-30 03:01:15,086 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 354.4MB. Free memory is still 307.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 175.60ms. Allocated memory is still 591.4MB. Free memory was 550.8MB in the beginning and 538.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.08ms. Allocated memory is still 591.4MB. Free memory was 538.7MB in the beginning and 536.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 591.4MB. Free memory was 536.2MB in the beginning and 534.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 592.99ms. Allocated memory is still 591.4MB. Free memory was 534.1MB in the beginning and 508.7MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 6790.36ms. Allocated memory was 591.4MB in the beginning and 1.3GB in the end (delta: 679.5MB). Free memory was 507.8MB in the beginning and 1.0GB in the end (delta: -533.8MB). Peak memory consumption was 460.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 545 locations, 53 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: 6.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 469 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 229 mSDtfsCounter, 469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2807occurred in iteration=22, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2050 NumberOfCodeBlocks, 2050 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2028 ConstructedInterpolants, 0 QuantifiedInterpolants, 2230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 33 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:01:15,103 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...