/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:11:16,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:11:16,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:11:16,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:11:16,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:11:16,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:11:16,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:11:16,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:11:16,193 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:11:16,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:11:16,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:11:16,197 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:11:16,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:11:16,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:11:16,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:11:16,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:11:16,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:11:16,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:11:16,199 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:11:16,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:11:16,199 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:11:16,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:11:16,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:11:16,200 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:11:16,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:11:16,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:11:16,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:11:16,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:11:16,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:11:16,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:11:16,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:11:16,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:11:16,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:11:16,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:11:16,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:11:16,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:11:16,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:11:16,405 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:11:16,406 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:11:16,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2023-11-30 03:11:17,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:11:17,556 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:11:17,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-4.wvr.c [2023-11-30 03:11:17,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6637ce70/a1a989972ef6448591d3b282347b0a38/FLAG0caa839b0 [2023-11-30 03:11:17,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6637ce70/a1a989972ef6448591d3b282347b0a38 [2023-11-30 03:11:17,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:11:17,576 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:11:17,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:11:17,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:11:17,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:11:17,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8a8ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17, skipping insertion in model container [2023-11-30 03:11:17,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,606 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:11:17,721 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:11:17,727 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:11:17,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:11:17,753 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:11:17,753 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 03:11:17,757 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:11:17,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17 WrapperNode [2023-11-30 03:11:17,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:11:17,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:11:17,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:11:17,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:11:17,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,795 INFO L138 Inliner]: procedures = 23, calls = 71, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 421 [2023-11-30 03:11:17,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:11:17,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:11:17,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:11:17,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:11:17,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:11:17,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:11:17,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:11:17,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:11:17,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (1/1) ... [2023-11-30 03:11:17,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:11:17,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:11:17,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:11:17,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:11:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:11:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:11:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:11:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:11:17,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:11:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 03:11:17,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 03:11:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 03:11:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:11:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:11:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:11:17,991 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:11:18,105 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:11:18,107 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:11:18,584 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:11:18,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:11:18,704 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 03:11:18,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:11:18 BoogieIcfgContainer [2023-11-30 03:11:18,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:11:18,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:11:18,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:11:18,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:11:18,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:11:17" (1/3) ... [2023-11-30 03:11:18,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbe9da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:11:18, skipping insertion in model container [2023-11-30 03:11:18,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:11:17" (2/3) ... [2023-11-30 03:11:18,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbe9da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:11:18, skipping insertion in model container [2023-11-30 03:11:18,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:11:18" (3/3) ... [2023-11-30 03:11:18,711 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2023-11-30 03:11:18,725 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:11:18,725 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-30 03:11:18,725 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:11:18,806 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 03:11:18,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 303 places, 295 transitions, 618 flow [2023-11-30 03:11:18,950 INFO L124 PetriNetUnfolderBase]: 5/291 cut-off events. [2023-11-30 03:11:18,950 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:11:18,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 291 events. 5/291 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 310 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2023-11-30 03:11:18,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 303 places, 295 transitions, 618 flow [2023-11-30 03:11:18,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 266 transitions, 556 flow [2023-11-30 03:11:18,977 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:11:18,984 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;@37bc334a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:11:18,986 INFO L363 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2023-11-30 03:11:18,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:11:18,995 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2023-11-30 03:11:18,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:11:18,996 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:18,996 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] [2023-11-30 03:11:18,997 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:19,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1739674211, now seen corresponding path program 1 times [2023-11-30 03:11:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:19,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152688082] [2023-11-30 03:11:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:19,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:19,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152688082] [2023-11-30 03:11:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152688082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:19,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:19,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839700287] [2023-11-30 03:11:19,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:19,199 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:19,222 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 295 [2023-11-30 03:11:19,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 266 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:19,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:19,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 295 [2023-11-30 03:11:19,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:20,038 INFO L124 PetriNetUnfolderBase]: 2442/4387 cut-off events. [2023-11-30 03:11:20,038 INFO L125 PetriNetUnfolderBase]: For 745/972 co-relation queries the response was YES. [2023-11-30 03:11:20,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8459 conditions, 4387 events. 2442/4387 cut-off events. For 745/972 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 29046 event pairs, 2439 based on Foata normal form. 1/4320 useless extension candidates. Maximal degree in co-relation 8038. Up to 3535 conditions per place. [2023-11-30 03:11:20,066 INFO L140 encePairwiseOnDemand]: 248/295 looper letters, 28 selfloop transitions, 2 changer transitions 1/221 dead transitions. [2023-11-30 03:11:20,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 221 transitions, 526 flow [2023-11-30 03:11:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2023-11-30 03:11:20,079 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8203389830508474 [2023-11-30 03:11:20,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 726 transitions. [2023-11-30 03:11:20,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 726 transitions. [2023-11-30 03:11:20,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:20,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 726 transitions. [2023-11-30 03:11:20,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,096 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -42 predicate places. [2023-11-30 03:11:20,096 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 221 transitions, 526 flow [2023-11-30 03:11:20,097 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,097 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:20,097 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:20,097 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:11:20,097 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:20,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1763867946, now seen corresponding path program 1 times [2023-11-30 03:11:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453181931] [2023-11-30 03:11:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:20,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:20,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453181931] [2023-11-30 03:11:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453181931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:20,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914699013] [2023-11-30 03:11:20,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:20,135 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:20,137 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 295 [2023-11-30 03:11:20,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 221 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:20,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 295 [2023-11-30 03:11:20,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:20,742 INFO L124 PetriNetUnfolderBase]: 2442/4386 cut-off events. [2023-11-30 03:11:20,743 INFO L125 PetriNetUnfolderBase]: For 1193/25052 co-relation queries the response was YES. [2023-11-30 03:11:20,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11995 conditions, 4386 events. 2442/4386 cut-off events. For 1193/25052 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 28922 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 11482. Up to 3535 conditions per place. [2023-11-30 03:11:20,771 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 28 selfloop transitions, 2 changer transitions 1/220 dead transitions. [2023-11-30 03:11:20,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 220 transitions, 584 flow [2023-11-30 03:11:20,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-11-30 03:11:20,773 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7706214689265537 [2023-11-30 03:11:20,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-11-30 03:11:20,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-11-30 03:11:20,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:20,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-11-30 03:11:20,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,777 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,777 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -41 predicate places. [2023-11-30 03:11:20,777 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 220 transitions, 584 flow [2023-11-30 03:11:20,778 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,778 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:20,778 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:20,778 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:11:20,779 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:20,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2093754300, now seen corresponding path program 1 times [2023-11-30 03:11:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329711379] [2023-11-30 03:11:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:20,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329711379] [2023-11-30 03:11:20,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329711379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:20,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:20,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:20,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700658180] [2023-11-30 03:11:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:20,831 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:20,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:20,832 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 295 [2023-11-30 03:11:20,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 220 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:20,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:20,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 295 [2023-11-30 03:11:20,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:21,381 INFO L124 PetriNetUnfolderBase]: 2442/4385 cut-off events. [2023-11-30 03:11:21,381 INFO L125 PetriNetUnfolderBase]: For 1928/49419 co-relation queries the response was YES. [2023-11-30 03:11:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15531 conditions, 4385 events. 2442/4385 cut-off events. For 1928/49419 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 28950 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 14926. Up to 3535 conditions per place. [2023-11-30 03:11:21,411 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 28 selfloop transitions, 2 changer transitions 1/219 dead transitions. [2023-11-30 03:11:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 219 transitions, 642 flow [2023-11-30 03:11:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-11-30 03:11:21,413 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7706214689265537 [2023-11-30 03:11:21,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-11-30 03:11:21,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-11-30 03:11:21,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:21,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-11-30 03:11:21,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:21,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:21,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:21,417 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -40 predicate places. [2023-11-30 03:11:21,417 INFO L500 AbstractCegarLoop]: Abstraction has has 235 places, 219 transitions, 642 flow [2023-11-30 03:11:21,418 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:21,418 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:21,418 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] [2023-11-30 03:11:21,418 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:11:21,418 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:21,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash 359696817, now seen corresponding path program 1 times [2023-11-30 03:11:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811734751] [2023-11-30 03:11:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811734751] [2023-11-30 03:11:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811734751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:21,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057995729] [2023-11-30 03:11:21,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:21,451 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:21,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:21,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:21,452 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 295 [2023-11-30 03:11:21,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 219 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:21,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:21,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 295 [2023-11-30 03:11:21,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:22,009 INFO L124 PetriNetUnfolderBase]: 2442/4384 cut-off events. [2023-11-30 03:11:22,009 INFO L125 PetriNetUnfolderBase]: For 2950/74073 co-relation queries the response was YES. [2023-11-30 03:11:22,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19067 conditions, 4384 events. 2442/4384 cut-off events. For 2950/74073 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 29025 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 18370. Up to 3535 conditions per place. [2023-11-30 03:11:22,043 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 28 selfloop transitions, 2 changer transitions 1/218 dead transitions. [2023-11-30 03:11:22,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 218 transitions, 700 flow [2023-11-30 03:11:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-11-30 03:11:22,045 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7706214689265537 [2023-11-30 03:11:22,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-11-30 03:11:22,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-11-30 03:11:22,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:22,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-11-30 03:11:22,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,049 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,049 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -39 predicate places. [2023-11-30 03:11:22,049 INFO L500 AbstractCegarLoop]: Abstraction has has 236 places, 218 transitions, 700 flow [2023-11-30 03:11:22,050 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,050 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:22,050 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] [2023-11-30 03:11:22,050 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:11:22,050 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:22,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:22,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1059656483, now seen corresponding path program 1 times [2023-11-30 03:11:22,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880811809] [2023-11-30 03:11:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:22,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880811809] [2023-11-30 03:11:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880811809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475920791] [2023-11-30 03:11:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:22,084 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:22,085 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 295 [2023-11-30 03:11:22,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 218 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:22,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 295 [2023-11-30 03:11:22,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:22,794 INFO L124 PetriNetUnfolderBase]: 2442/4383 cut-off events. [2023-11-30 03:11:22,794 INFO L125 PetriNetUnfolderBase]: For 4259/99014 co-relation queries the response was YES. [2023-11-30 03:11:22,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22612 conditions, 4383 events. 2442/4383 cut-off events. For 4259/99014 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 28941 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 21814. Up to 3544 conditions per place. [2023-11-30 03:11:22,831 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 37 selfloop transitions, 2 changer transitions 1/217 dead transitions. [2023-11-30 03:11:22,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 217 transitions, 776 flow [2023-11-30 03:11:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2023-11-30 03:11:22,833 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7502824858757062 [2023-11-30 03:11:22,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2023-11-30 03:11:22,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2023-11-30 03:11:22,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:22,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2023-11-30 03:11:22,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,839 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -38 predicate places. [2023-11-30 03:11:22,839 INFO L500 AbstractCegarLoop]: Abstraction has has 237 places, 217 transitions, 776 flow [2023-11-30 03:11:22,840 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,840 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:22,840 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] [2023-11-30 03:11:22,840 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:11:22,840 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:22,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2135544124, now seen corresponding path program 1 times [2023-11-30 03:11:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:22,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068381089] [2023-11-30 03:11:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:22,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:22,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068381089] [2023-11-30 03:11:22,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068381089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:22,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:22,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717851324] [2023-11-30 03:11:22,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:22,885 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:22,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:22,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:22,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:22,886 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 295 [2023-11-30 03:11:22,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 217 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:22,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:22,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 295 [2023-11-30 03:11:22,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:23,570 INFO L124 PetriNetUnfolderBase]: 2442/4382 cut-off events. [2023-11-30 03:11:23,570 INFO L125 PetriNetUnfolderBase]: For 5855/124242 co-relation queries the response was YES. [2023-11-30 03:11:23,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26151 conditions, 4382 events. 2442/4382 cut-off events. For 5855/124242 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 29085 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 25258. Up to 3544 conditions per place. [2023-11-30 03:11:23,613 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 31 selfloop transitions, 2 changer transitions 1/216 dead transitions. [2023-11-30 03:11:23,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 216 transitions, 840 flow [2023-11-30 03:11:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2023-11-30 03:11:23,615 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7638418079096045 [2023-11-30 03:11:23,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2023-11-30 03:11:23,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2023-11-30 03:11:23,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:23,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2023-11-30 03:11:23,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:23,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:23,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:23,619 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -37 predicate places. [2023-11-30 03:11:23,619 INFO L500 AbstractCegarLoop]: Abstraction has has 238 places, 216 transitions, 840 flow [2023-11-30 03:11:23,619 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:23,619 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:23,620 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] [2023-11-30 03:11:23,620 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:11:23,620 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:23,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1724559055, now seen corresponding path program 1 times [2023-11-30 03:11:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930127514] [2023-11-30 03:11:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930127514] [2023-11-30 03:11:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930127514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:23,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535635887] [2023-11-30 03:11:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:23,649 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:23,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:23,650 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 295 [2023-11-30 03:11:23,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 216 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:23,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:23,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 295 [2023-11-30 03:11:23,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:24,302 INFO L124 PetriNetUnfolderBase]: 2442/4381 cut-off events. [2023-11-30 03:11:24,302 INFO L125 PetriNetUnfolderBase]: For 7738/149757 co-relation queries the response was YES. [2023-11-30 03:11:24,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29690 conditions, 4381 events. 2442/4381 cut-off events. For 7738/149757 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 28941 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 28702. Up to 3544 conditions per place. [2023-11-30 03:11:24,360 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 31 selfloop transitions, 2 changer transitions 1/215 dead transitions. [2023-11-30 03:11:24,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 215 transitions, 904 flow [2023-11-30 03:11:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2023-11-30 03:11:24,362 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7638418079096045 [2023-11-30 03:11:24,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2023-11-30 03:11:24,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2023-11-30 03:11:24,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:24,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2023-11-30 03:11:24,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:24,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:24,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:24,366 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -36 predicate places. [2023-11-30 03:11:24,366 INFO L500 AbstractCegarLoop]: Abstraction has has 239 places, 215 transitions, 904 flow [2023-11-30 03:11:24,366 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:24,366 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:24,366 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:11:24,367 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:11:24,367 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:24,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2109851561, now seen corresponding path program 1 times [2023-11-30 03:11:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881485586] [2023-11-30 03:11:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:24,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881485586] [2023-11-30 03:11:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881485586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:24,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223908211] [2023-11-30 03:11:24,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:24,398 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:24,399 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 295 [2023-11-30 03:11:24,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 215 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:24,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:24,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 295 [2023-11-30 03:11:24,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:25,046 INFO L124 PetriNetUnfolderBase]: 2442/4380 cut-off events. [2023-11-30 03:11:25,046 INFO L125 PetriNetUnfolderBase]: For 9908/175559 co-relation queries the response was YES. [2023-11-30 03:11:25,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33231 conditions, 4380 events. 2442/4380 cut-off events. For 9908/175559 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 28956 event pairs, 2439 based on Foata normal form. 0/4319 useless extension candidates. Maximal degree in co-relation 32146. Up to 3544 conditions per place. [2023-11-30 03:11:25,115 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 33 selfloop transitions, 2 changer transitions 1/214 dead transitions. [2023-11-30 03:11:25,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 214 transitions, 972 flow [2023-11-30 03:11:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-11-30 03:11:25,116 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7559322033898305 [2023-11-30 03:11:25,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-11-30 03:11:25,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-11-30 03:11:25,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:25,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-11-30 03:11:25,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:25,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:25,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:25,120 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -35 predicate places. [2023-11-30 03:11:25,120 INFO L500 AbstractCegarLoop]: Abstraction has has 240 places, 214 transitions, 972 flow [2023-11-30 03:11:25,120 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:25,120 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:25,120 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:25,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:11:25,120 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:25,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1263462403, now seen corresponding path program 1 times [2023-11-30 03:11:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851643297] [2023-11-30 03:11:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851643297] [2023-11-30 03:11:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851643297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:25,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316018703] [2023-11-30 03:11:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:25,145 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:25,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:25,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:25,146 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 295 [2023-11-30 03:11:25,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 214 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:25,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:25,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 295 [2023-11-30 03:11:25,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:26,208 INFO L124 PetriNetUnfolderBase]: 3446/7266 cut-off events. [2023-11-30 03:11:26,208 INFO L125 PetriNetUnfolderBase]: For 16922/52786 co-relation queries the response was YES. [2023-11-30 03:11:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53751 conditions, 7266 events. 3446/7266 cut-off events. For 16922/52786 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 59274 event pairs, 1575 based on Foata normal form. 0/6967 useless extension candidates. Maximal degree in co-relation 52238. Up to 5082 conditions per place. [2023-11-30 03:11:26,278 INFO L140 encePairwiseOnDemand]: 283/295 looper letters, 47 selfloop transitions, 9 changer transitions 1/234 dead transitions. [2023-11-30 03:11:26,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 234 transitions, 1504 flow [2023-11-30 03:11:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2023-11-30 03:11:26,279 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7853107344632768 [2023-11-30 03:11:26,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 695 transitions. [2023-11-30 03:11:26,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 695 transitions. [2023-11-30 03:11:26,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:26,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 695 transitions. [2023-11-30 03:11:26,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,283 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -36 predicate places. [2023-11-30 03:11:26,283 INFO L500 AbstractCegarLoop]: Abstraction has has 239 places, 234 transitions, 1504 flow [2023-11-30 03:11:26,283 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,283 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:26,283 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] [2023-11-30 03:11:26,283 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:11:26,283 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:26,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1288407922, now seen corresponding path program 1 times [2023-11-30 03:11:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657537920] [2023-11-30 03:11:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657537920] [2023-11-30 03:11:26,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657537920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:26,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:26,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275042893] [2023-11-30 03:11:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:26,305 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:26,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:26,306 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 295 [2023-11-30 03:11:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 234 transitions, 1504 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 295 [2023-11-30 03:11:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:27,233 INFO L124 PetriNetUnfolderBase]: 3446/7073 cut-off events. [2023-11-30 03:11:27,234 INFO L125 PetriNetUnfolderBase]: For 21775/234851 co-relation queries the response was YES. [2023-11-30 03:11:27,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58634 conditions, 7073 events. 3446/7073 cut-off events. For 21775/234851 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 55758 event pairs, 1305 based on Foata normal form. 6/6894 useless extension candidates. Maximal degree in co-relation 57003. Up to 5082 conditions per place. [2023-11-30 03:11:27,326 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 54 selfloop transitions, 5 changer transitions 1/240 dead transitions. [2023-11-30 03:11:27,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 240 transitions, 1767 flow [2023-11-30 03:11:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-11-30 03:11:27,328 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7807909604519774 [2023-11-30 03:11:27,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-11-30 03:11:27,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-11-30 03:11:27,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:27,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-11-30 03:11:27,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:27,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:27,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:27,331 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -35 predicate places. [2023-11-30 03:11:27,332 INFO L500 AbstractCegarLoop]: Abstraction has has 240 places, 240 transitions, 1767 flow [2023-11-30 03:11:27,332 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:27,332 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:27,332 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] [2023-11-30 03:11:27,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:11:27,332 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -138182986, now seen corresponding path program 1 times [2023-11-30 03:11:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333241336] [2023-11-30 03:11:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333241336] [2023-11-30 03:11:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333241336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199883672] [2023-11-30 03:11:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:27,370 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:27,371 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 295 [2023-11-30 03:11:27,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 240 transitions, 1767 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:27,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:27,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 295 [2023-11-30 03:11:27,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:28,845 INFO L124 PetriNetUnfolderBase]: 4871/10003 cut-off events. [2023-11-30 03:11:28,845 INFO L125 PetriNetUnfolderBase]: For 28366/61389 co-relation queries the response was YES. [2023-11-30 03:11:28,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89476 conditions, 10003 events. 4871/10003 cut-off events. For 28366/61389 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 84723 event pairs, 1898 based on Foata normal form. 0/9652 useless extension candidates. Maximal degree in co-relation 62182. Up to 7139 conditions per place. [2023-11-30 03:11:28,959 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 99 selfloop transitions, 3 changer transitions 1/282 dead transitions. [2023-11-30 03:11:28,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 282 transitions, 2940 flow [2023-11-30 03:11:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2023-11-30 03:11:28,961 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7943502824858757 [2023-11-30 03:11:28,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2023-11-30 03:11:28,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2023-11-30 03:11:28,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:28,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2023-11-30 03:11:28,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:28,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:28,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:28,964 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -34 predicate places. [2023-11-30 03:11:28,965 INFO L500 AbstractCegarLoop]: Abstraction has has 241 places, 282 transitions, 2940 flow [2023-11-30 03:11:28,965 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:28,965 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:28,965 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] [2023-11-30 03:11:28,965 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:11:28,965 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:28,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 560142648, now seen corresponding path program 1 times [2023-11-30 03:11:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069095129] [2023-11-30 03:11:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069095129] [2023-11-30 03:11:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069095129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:11:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011666801] [2023-11-30 03:11:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:28,986 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:11:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:11:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:11:28,987 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 295 [2023-11-30 03:11:28,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 282 transitions, 2940 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:28,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:28,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 295 [2023-11-30 03:11:28,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:30,900 INFO L124 PetriNetUnfolderBase]: 6053/12245 cut-off events. [2023-11-30 03:11:30,901 INFO L125 PetriNetUnfolderBase]: For 61416/774076 co-relation queries the response was YES. [2023-11-30 03:11:30,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118526 conditions, 12245 events. 6053/12245 cut-off events. For 61416/774076 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 104235 event pairs, 2535 based on Foata normal form. 3/11821 useless extension candidates. Maximal degree in co-relation 58703. Up to 8754 conditions per place. [2023-11-30 03:11:31,097 INFO L140 encePairwiseOnDemand]: 288/295 looper letters, 153 selfloop transitions, 10 changer transitions 4/342 dead transitions. [2023-11-30 03:11:31,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 342 transitions, 4807 flow [2023-11-30 03:11:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:11:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:11:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2023-11-30 03:11:31,099 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7864406779661017 [2023-11-30 03:11:31,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 696 transitions. [2023-11-30 03:11:31,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 696 transitions. [2023-11-30 03:11:31,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:31,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 696 transitions. [2023-11-30 03:11:31,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:31,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:31,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:31,103 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -34 predicate places. [2023-11-30 03:11:31,103 INFO L500 AbstractCegarLoop]: Abstraction has has 241 places, 342 transitions, 4807 flow [2023-11-30 03:11:31,103 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:31,104 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:31,104 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:11:31,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:11:31,104 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:31,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1313582900, now seen corresponding path program 1 times [2023-11-30 03:11:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257704430] [2023-11-30 03:11:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257704430] [2023-11-30 03:11:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257704430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:31,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356736603] [2023-11-30 03:11:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:31,477 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:31,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:31,479 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 295 [2023-11-30 03:11:31,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 342 transitions, 4807 flow. Second operand has 6 states, 6 states have (on average 195.16666666666666) internal successors, (1171), 6 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:31,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:31,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 295 [2023-11-30 03:11:31,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:42,230 INFO L124 PetriNetUnfolderBase]: 47225/66833 cut-off events. [2023-11-30 03:11:42,231 INFO L125 PetriNetUnfolderBase]: For 2796965/2834775 co-relation queries the response was YES. [2023-11-30 03:11:42,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730383 conditions, 66833 events. 47225/66833 cut-off events. For 2796965/2834775 co-relation queries the response was YES. Maximal size of possible extension queue 2381. Compared 458719 event pairs, 5856 based on Foata normal form. 0/66270 useless extension candidates. Maximal degree in co-relation 370536. Up to 49926 conditions per place. [2023-11-30 03:11:43,529 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 641 selfloop transitions, 4 changer transitions 5/801 dead transitions. [2023-11-30 03:11:43,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 801 transitions, 18059 flow [2023-11-30 03:11:43,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2023-11-30 03:11:43,531 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7225988700564971 [2023-11-30 03:11:43,531 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1279 transitions. [2023-11-30 03:11:43,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1279 transitions. [2023-11-30 03:11:43,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:43,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1279 transitions. [2023-11-30 03:11:43,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:43,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:43,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:43,537 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -30 predicate places. [2023-11-30 03:11:43,537 INFO L500 AbstractCegarLoop]: Abstraction has has 245 places, 801 transitions, 18059 flow [2023-11-30 03:11:43,537 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.16666666666666) internal successors, (1171), 6 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:43,537 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:43,537 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:11:43,537 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:11:43,538 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:43,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1832034331, now seen corresponding path program 1 times [2023-11-30 03:11:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116189951] [2023-11-30 03:11:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116189951] [2023-11-30 03:11:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116189951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876443656] [2023-11-30 03:11:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:43,962 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:43,963 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 295 [2023-11-30 03:11:43,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 801 transitions, 18059 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:43,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:43,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 295 [2023-11-30 03:11:43,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:11:57,950 INFO L124 PetriNetUnfolderBase]: 47241/66267 cut-off events. [2023-11-30 03:11:57,950 INFO L125 PetriNetUnfolderBase]: For 2828102/2863674 co-relation queries the response was YES. [2023-11-30 03:11:58,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791094 conditions, 66267 events. 47241/66267 cut-off events. For 2828102/2863674 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 444950 event pairs, 5709 based on Foata normal form. 0/65896 useless extension candidates. Maximal degree in co-relation 463262. Up to 55718 conditions per place. [2023-11-30 03:11:59,396 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 808 selfloop transitions, 4 changer transitions 5/968 dead transitions. [2023-11-30 03:11:59,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 968 transitions, 24387 flow [2023-11-30 03:11:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:11:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:11:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1258 transitions. [2023-11-30 03:11:59,398 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7107344632768362 [2023-11-30 03:11:59,398 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1258 transitions. [2023-11-30 03:11:59,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1258 transitions. [2023-11-30 03:11:59,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:11:59,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1258 transitions. [2023-11-30 03:11:59,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.66666666666666) internal successors, (1258), 6 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:59,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:59,404 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:59,404 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -26 predicate places. [2023-11-30 03:11:59,404 INFO L500 AbstractCegarLoop]: Abstraction has has 249 places, 968 transitions, 24387 flow [2023-11-30 03:11:59,414 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:59,414 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:11:59,414 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:11:59,414 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:11:59,414 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:11:59,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:11:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1902592094, now seen corresponding path program 1 times [2023-11-30 03:11:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:11:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212167294] [2023-11-30 03:11:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:11:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:11:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:11:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:11:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:11:59,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212167294] [2023-11-30 03:11:59,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212167294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:11:59,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:11:59,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:11:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414000445] [2023-11-30 03:11:59,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:11:59,821 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:11:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:11:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:11:59,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:11:59,823 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 295 [2023-11-30 03:11:59,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 968 transitions, 24387 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:11:59,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:11:59,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 295 [2023-11-30 03:11:59,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:12:15,307 INFO L124 PetriNetUnfolderBase]: 47375/66871 cut-off events. [2023-11-30 03:12:15,308 INFO L125 PetriNetUnfolderBase]: For 2803610/2832844 co-relation queries the response was YES. [2023-11-30 03:12:15,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854756 conditions, 66871 events. 47375/66871 cut-off events. For 2803610/2832844 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 456765 event pairs, 5784 based on Foata normal form. 0/66731 useless extension candidates. Maximal degree in co-relation 499523. Up to 60627 conditions per place. [2023-11-30 03:12:16,942 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 871 selfloop transitions, 4 changer transitions 5/1031 dead transitions. [2023-11-30 03:12:16,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 1031 transitions, 28055 flow [2023-11-30 03:12:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:12:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:12:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1241 transitions. [2023-11-30 03:12:16,945 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7011299435028249 [2023-11-30 03:12:16,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1241 transitions. [2023-11-30 03:12:16,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1241 transitions. [2023-11-30 03:12:16,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:12:16,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1241 transitions. [2023-11-30 03:12:16,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.83333333333334) internal successors, (1241), 6 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:16,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:16,949 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:16,949 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -22 predicate places. [2023-11-30 03:12:16,949 INFO L500 AbstractCegarLoop]: Abstraction has has 253 places, 1031 transitions, 28055 flow [2023-11-30 03:12:16,950 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:16,950 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:12:16,950 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:12:16,950 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:12:16,950 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 105 more)] === [2023-11-30 03:12:16,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:12:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1628881233, now seen corresponding path program 1 times [2023-11-30 03:12:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:12:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240996307] [2023-11-30 03:12:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:12:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:12:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:12:17,315 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:12:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:12:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240996307] [2023-11-30 03:12:17,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240996307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:12:17,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:12:17,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:12:17,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966871500] [2023-11-30 03:12:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:12:17,320 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:12:17,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:12:17,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:12:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:12:17,321 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 295 [2023-11-30 03:12:17,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 1031 transitions, 28055 flow. Second operand has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:17,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:12:17,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 295 [2023-11-30 03:12:17,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:12:34,316 INFO L124 PetriNetUnfolderBase]: 48307/68374 cut-off events. [2023-11-30 03:12:34,317 INFO L125 PetriNetUnfolderBase]: For 2806220/2806220 co-relation queries the response was YES. [2023-11-30 03:12:34,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932673 conditions, 68374 events. 48307/68374 cut-off events. For 2806220/2806220 co-relation queries the response was YES. Maximal size of possible extension queue 2409. Compared 469425 event pairs, 6339 based on Foata normal form. 0/68275 useless extension candidates. Maximal degree in co-relation 543928. Up to 62389 conditions per place. [2023-11-30 03:12:34,848 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 0 selfloop transitions, 0 changer transitions 1054/1054 dead transitions. [2023-11-30 03:12:34,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1054 transitions, 30615 flow [2023-11-30 03:12:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:12:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:12:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2023-11-30 03:12:34,851 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6915254237288135 [2023-11-30 03:12:34,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1224 transitions. [2023-11-30 03:12:34,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1224 transitions. [2023-11-30 03:12:34,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:12:34,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1224 transitions. [2023-11-30 03:12:34,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:34,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:34,855 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:34,855 INFO L307 CegarLoopForPetriNet]: 275 programPoint places, -18 predicate places. [2023-11-30 03:12:34,855 INFO L500 AbstractCegarLoop]: Abstraction has has 257 places, 1054 transitions, 30615 flow [2023-11-30 03:12:34,855 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:12:34,863 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-4.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:12:34,914 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (108 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (107 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (106 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (105 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (104 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (103 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (102 of 109 remaining) [2023-11-30 03:12:34,915 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (101 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (100 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (99 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (98 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (97 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (96 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (95 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (94 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (93 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (92 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (91 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (90 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (89 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (88 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (87 of 109 remaining) [2023-11-30 03:12:34,916 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (86 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (85 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (84 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (83 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (82 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (80 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (79 of 109 remaining) [2023-11-30 03:12:34,917 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (78 of 109 remaining) [2023-11-30 03:12:34,918 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (77 of 109 remaining) [2023-11-30 03:12:34,918 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (76 of 109 remaining) [2023-11-30 03:12:34,918 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (75 of 109 remaining) [2023-11-30 03:12:34,918 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (74 of 109 remaining) [2023-11-30 03:12:34,918 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (73 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (72 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (71 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (70 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (69 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (67 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (66 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (65 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (64 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (62 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (61 of 109 remaining) [2023-11-30 03:12:34,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (60 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (59 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (58 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (53 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (52 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (51 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (50 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (49 of 109 remaining) [2023-11-30 03:12:34,920 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (48 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (47 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (46 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (45 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (44 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (43 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (42 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (41 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (40 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (39 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (38 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (37 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (36 of 109 remaining) [2023-11-30 03:12:34,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (35 of 109 remaining) [2023-11-30 03:12:34,922 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (34 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 109 remaining) [2023-11-30 03:12:34,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (8 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (7 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (6 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 109 remaining) [2023-11-30 03:12:34,924 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 109 remaining) [2023-11-30 03:12:34,925 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (3 of 109 remaining) [2023-11-30 03:12:34,925 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (2 of 109 remaining) [2023-11-30 03:12:34,925 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (1 of 109 remaining) [2023-11-30 03:12:34,925 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 109 remaining) [2023-11-30 03:12:34,925 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:12:34,925 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:12:34,930 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:12:34,930 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:12:34,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:12:34 BasicIcfg [2023-11-30 03:12:34,935 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:12:34,936 INFO L158 Benchmark]: Toolchain (without parser) took 77359.35ms. Allocated memory was 406.8MB in the beginning and 15.5GB in the end (delta: 15.1GB). Free memory was 359.5MB in the beginning and 10.5GB in the end (delta: -10.1GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-11-30 03:12:34,936 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 406.8MB. Free memory is still 362.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:12:34,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.76ms. Allocated memory is still 406.8MB. Free memory was 359.1MB in the beginning and 346.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:12:34,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.73ms. Allocated memory is still 406.8MB. Free memory was 346.6MB in the beginning and 343.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:12:34,937 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 406.8MB. Free memory was 343.4MB in the beginning and 341.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:12:34,937 INFO L158 Benchmark]: RCFGBuilder took 862.24ms. Allocated memory was 406.8MB in the beginning and 608.2MB in the end (delta: 201.3MB). Free memory was 341.3MB in the beginning and 541.1MB in the end (delta: -199.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. [2023-11-30 03:12:34,938 INFO L158 Benchmark]: TraceAbstraction took 76228.06ms. Allocated memory was 608.2MB in the beginning and 15.5GB in the end (delta: 14.9GB). Free memory was 540.1MB in the beginning and 10.5GB in the end (delta: -9.9GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-11-30 03:12:34,940 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 406.8MB. Free memory is still 362.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 179.76ms. Allocated memory is still 406.8MB. Free memory was 359.1MB in the beginning and 346.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.73ms. Allocated memory is still 406.8MB. Free memory was 346.6MB in the beginning and 343.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 406.8MB. Free memory was 343.4MB in the beginning and 341.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 862.24ms. Allocated memory was 406.8MB in the beginning and 608.2MB in the end (delta: 201.3MB). Free memory was 341.3MB in the beginning and 541.1MB in the end (delta: -199.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. * TraceAbstraction took 76228.06ms. Allocated memory was 608.2MB in the beginning and 15.5GB in the end (delta: 14.9GB). Free memory was 540.1MB in the beginning and 10.5GB in the end (delta: -9.9GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 371 locations, 109 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: 76.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 73.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1455 IncrementalHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 117 mSDtfsCounter, 1455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30615occurred in iteration=16, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1412 NumberOfCodeBlocks, 1412 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1396 ConstructedInterpolants, 0 QuantifiedInterpolants, 1744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 62 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:12:34,968 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...