/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf-b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 22:17:25,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 22:17:25,719 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-VariableLbe.epf [2023-08-25 22:17:25,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 22:17:25,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 22:17:25,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 22:17:25,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 22:17:25,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 22:17:25,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 22:17:25,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 22:17:25,753 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 22:17:25,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 22:17:25,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 22:17:25,754 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 22:17:25,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 22:17:25,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 22:17:25,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 22:17:25,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 22:17:25,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 22:17:25,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 22:17:25,755 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 22:17:25,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 22:17:25,756 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 22:17:25,756 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 22:17:25,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 22:17:25,756 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 22:17:25,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 22:17:25,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:17:25,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 22:17:25,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 22:17:25,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 22:17:25,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 22:17:25,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 22:17:25,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 22:17:25,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 22:17:25,758 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 22:17:25,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 22:17:26,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 22:17:26,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 22:17:26,019 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 22:17:26,019 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 22:17:26,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf-b.i [2023-08-25 22:17:26,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 22:17:27,164 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 22:17:27,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf-b.i [2023-08-25 22:17:27,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8f5aa28/cfe26b2044574965940c2f4f23acff64/FLAGf1111e26a [2023-08-25 22:17:27,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8f5aa28/cfe26b2044574965940c2f4f23acff64 [2023-08-25 22:17:27,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 22:17:27,190 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 22:17:27,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 22:17:27,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 22:17:27,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 22:17:27,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f31df4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27, skipping insertion in model container [2023-08-25 22:17:27,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,234 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 22:17:27,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:17:27,487 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 22:17:27,506 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-25 22:17:27,508 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [253] [2023-08-25 22:17:27,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:17:27,549 INFO L206 MainTranslator]: Completed translation [2023-08-25 22:17:27,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27 WrapperNode [2023-08-25 22:17:27,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 22:17:27,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 22:17:27,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 22:17:27,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 22:17:27,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,576 INFO L138 Inliner]: procedures = 170, calls = 19, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 121 [2023-08-25 22:17:27,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 22:17:27,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 22:17:27,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 22:17:27,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 22:17:27,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 22:17:27,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 22:17:27,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 22:17:27,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 22:17:27,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (1/1) ... [2023-08-25 22:17:27,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:17:27,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:17:27,628 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-08-25 22:17:27,638 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-08-25 22:17:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-25 22:17:27,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-25 22:17:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 22:17:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 22:17:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 22:17:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 22:17:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 22:17:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 22:17:27,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 22:17:27,665 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 22:17:27,750 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 22:17:27,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 22:17:27,902 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 22:17:27,987 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 22:17:27,988 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-25 22:17:27,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:17:27 BoogieIcfgContainer [2023-08-25 22:17:27,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 22:17:27,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 22:17:27,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 22:17:27,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 22:17:27,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 10:17:27" (1/3) ... [2023-08-25 22:17:27,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3296b105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:17:27, skipping insertion in model container [2023-08-25 22:17:27,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:17:27" (2/3) ... [2023-08-25 22:17:27,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3296b105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:17:27, skipping insertion in model container [2023-08-25 22:17:27,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:17:27" (3/3) ... [2023-08-25 22:17:27,995 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf-b.i [2023-08-25 22:17:28,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 22:17:28,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-08-25 22:17:28,015 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 22:17:28,050 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:17:28,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:28,096 INFO L124 PetriNetUnfolderBase]: 6/105 cut-off events. [2023-08-25 22:17:28,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-25 22:17:28,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:28,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:28,105 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:17:28,110 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:28,111 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:28,126 INFO L124 PetriNetUnfolderBase]: 6/105 cut-off events. [2023-08-25 22:17:28,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:28,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-25 22:17:28,127 INFO L119 LiptonReduction]: Number of co-enabled transitions 1768 [2023-08-25 22:17:30,389 INFO L134 LiptonReduction]: Checked pairs total: 1778 [2023-08-25 22:17:30,389 INFO L136 LiptonReduction]: Total number of compositions: 140 [2023-08-25 22:17:30,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:17:30,415 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@45281181, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:17:30,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-08-25 22:17:30,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:17:30,418 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-25 22:17:30,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:30,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:30,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 22:17:30,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 28 more)] === [2023-08-25 22:17:30,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 17345433, now seen corresponding path program 1 times [2023-08-25 22:17:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293803753] [2023-08-25 22:17:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:30,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293803753] [2023-08-25 22:17:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293803753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:30,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:17:30,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978772248] [2023-08-25 22:17:30,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:30,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:17:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:17:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:17:30,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 235 [2023-08-25 22:17:30,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 51 flow. Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:30,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 235 [2023-08-25 22:17:30,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:30,561 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-08-25 22:17:30,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:30,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-08-25 22:17:30,562 INFO L140 encePairwiseOnDemand]: 218/235 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2023-08-25 22:17:30,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 27 flow [2023-08-25 22:17:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:17:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:17:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2023-08-25 22:17:30,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3659574468085106 [2023-08-25 22:17:30,574 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 172 transitions. [2023-08-25 22:17:30,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 172 transitions. [2023-08-25 22:17:30,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:30,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 172 transitions. [2023-08-25 22:17:30,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,583 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,584 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 51 flow. Second operand 2 states and 172 transitions. [2023-08-25 22:17:30,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 27 flow [2023-08-25 22:17:30,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:30,586 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 17 flow [2023-08-25 22:17:30,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2023-08-25 22:17:30,594 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -16 predicate places. [2023-08-25 22:17:30,594 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 17 flow [2023-08-25 22:17:30,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:30,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 22:17:30,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 22:17:30,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 28 more)] === [2023-08-25 22:17:30,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 17345503, now seen corresponding path program 1 times [2023-08-25 22:17:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043551737] [2023-08-25 22:17:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:30,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:30,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043551737] [2023-08-25 22:17:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043551737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:30,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:17:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875520258] [2023-08-25 22:17:30,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:30,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:30,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 235 [2023-08-25 22:17:30,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 10 places, 6 transitions, 17 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:30,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 235 [2023-08-25 22:17:30,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:30,835 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-25 22:17:30,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:30,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-08-25 22:17:30,835 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-08-25 22:17:30,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 5 transitions, 23 flow [2023-08-25 22:17:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2023-08-25 22:17:30,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28368794326241137 [2023-08-25 22:17:30,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 200 transitions. [2023-08-25 22:17:30,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 200 transitions. [2023-08-25 22:17:30,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:30,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 200 transitions. [2023-08-25 22:17:30,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,845 INFO L175 Difference]: Start difference. First operand has 10 places, 6 transitions, 17 flow. Second operand 3 states and 200 transitions. [2023-08-25 22:17:30,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 5 transitions, 23 flow [2023-08-25 22:17:30,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 5 transitions, 23 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:30,845 INFO L231 Difference]: Finished difference. Result has 11 places, 0 transitions, 0 flow [2023-08-25 22:17:30,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=15, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=11, PETRI_TRANSITIONS=0} [2023-08-25 22:17:30,846 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -15 predicate places. [2023-08-25 22:17:30,846 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 0 transitions, 0 flow [2023-08-25 22:17:30,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:30,851 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (31 of 32 remaining) [2023-08-25 22:17:30,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2023-08-25 22:17:30,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2023-08-25 22:17:30,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONASSERT (28 of 32 remaining) [2023-08-25 22:17:30,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2023-08-25 22:17:30,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2023-08-25 22:17:30,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2023-08-25 22:17:30,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2023-08-25 22:17:30,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2023-08-25 22:17:30,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2023-08-25 22:17:30,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2023-08-25 22:17:30,861 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2023-08-25 22:17:30,862 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2023-08-25 22:17:30,862 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2023-08-25 22:17:30,862 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2023-08-25 22:17:30,863 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2023-08-25 22:17:30,863 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONASSERT (9 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2023-08-25 22:17:30,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2023-08-25 22:17:30,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2023-08-25 22:17:30,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2023-08-25 22:17:30,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2023-08-25 22:17:30,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2023-08-25 22:17:30,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2023-08-25 22:17:30,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2023-08-25 22:17:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 22:17:30,866 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-25 22:17:30,867 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-25 22:17:30,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:30,891 INFO L124 PetriNetUnfolderBase]: 6/105 cut-off events. [2023-08-25 22:17:30,891 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:30,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-25 22:17:30,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:30,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:30,892 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:17:30,892 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:30,892 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:30,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 95 transitions, 195 flow [2023-08-25 22:17:30,907 INFO L124 PetriNetUnfolderBase]: 6/105 cut-off events. [2023-08-25 22:17:30,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:30,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-08-25 22:17:30,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 1768 [2023-08-25 22:17:32,951 INFO L134 LiptonReduction]: Checked pairs total: 1726 [2023-08-25 22:17:32,952 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-25 22:17:32,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-25 22:17:32,953 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@45281181, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:17:32,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-25 22:17:32,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:17:32,956 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-08-25 22:17:32,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:32,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:32,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-25 22:17:32,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-25 22:17:32,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -489218094, now seen corresponding path program 1 times [2023-08-25 22:17:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421588884] [2023-08-25 22:17:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:17:32,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 22:17:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:17:33,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 22:17:33,007 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 22:17:33,007 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-25 22:17:33,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 22:17:33,007 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-25 22:17:33,008 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-25 22:17:33,009 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 22:17:33,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-25 22:17:33,034 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:17:33,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:33,063 INFO L124 PetriNetUnfolderBase]: 11/186 cut-off events. [2023-08-25 22:17:33,063 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:17:33,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 11/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 475 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2023-08-25 22:17:33,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:33,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:33,066 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:17:33,066 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:33,066 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:33,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:33,077 INFO L124 PetriNetUnfolderBase]: 11/186 cut-off events. [2023-08-25 22:17:33,077 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:17:33,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 11/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 475 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2023-08-25 22:17:33,083 INFO L119 LiptonReduction]: Number of co-enabled transitions 12920 [2023-08-25 22:17:34,024 INFO L134 LiptonReduction]: Checked pairs total: 43789 [2023-08-25 22:17:34,025 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-25 22:17:34,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:17:34,026 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@45281181, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:17:34,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2023-08-25 22:17:34,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:17:34,028 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-25 22:17:34,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:34,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:34,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 22:17:34,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:34,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 33171185, now seen corresponding path program 1 times [2023-08-25 22:17:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:34,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862922221] [2023-08-25 22:17:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862922221] [2023-08-25 22:17:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862922221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:17:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360751796] [2023-08-25 22:17:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:34,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:17:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:17:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:17:34,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-25 22:17:34,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 196 flow. Second operand has 2 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:34,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-25 22:17:34,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:34,217 INFO L124 PetriNetUnfolderBase]: 659/1554 cut-off events. [2023-08-25 22:17:34,217 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-25 22:17:34,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1554 events. 659/1554 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10731 event pairs, 599 based on Foata normal form. 0/1402 useless extension candidates. Maximal degree in co-relation 2127. Up to 1110 conditions per place. [2023-08-25 22:17:34,223 INFO L140 encePairwiseOnDemand]: 254/273 looper letters, 33 selfloop transitions, 0 changer transitions 0/73 dead transitions. [2023-08-25 22:17:34,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 224 flow [2023-08-25 22:17:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:17:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:17:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 304 transitions. [2023-08-25 22:17:34,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567765567765568 [2023-08-25 22:17:34,227 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 304 transitions. [2023-08-25 22:17:34,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 304 transitions. [2023-08-25 22:17:34,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:34,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 304 transitions. [2023-08-25 22:17:34,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,232 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,232 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 196 flow. Second operand 2 states and 304 transitions. [2023-08-25 22:17:34,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 224 flow [2023-08-25 22:17:34,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 222 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:34,233 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 156 flow [2023-08-25 22:17:34,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2023-08-25 22:17:34,235 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -18 predicate places. [2023-08-25 22:17:34,235 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 156 flow [2023-08-25 22:17:34,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:34,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 22:17:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 22:17:34,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:34,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1812766707, now seen corresponding path program 1 times [2023-08-25 22:17:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150649432] [2023-08-25 22:17:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:34,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150649432] [2023-08-25 22:17:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150649432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:34,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178589987] [2023-08-25 22:17:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:34,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:34,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:34,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:34,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 273 [2023-08-25 22:17:34,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:34,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 273 [2023-08-25 22:17:34,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:34,532 INFO L124 PetriNetUnfolderBase]: 1869/3950 cut-off events. [2023-08-25 22:17:34,532 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-08-25 22:17:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 3950 events. 1869/3950 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 30816 event pairs, 650 based on Foata normal form. 0/3410 useless extension candidates. Maximal degree in co-relation 7252. Up to 1951 conditions per place. [2023-08-25 22:17:34,548 INFO L140 encePairwiseOnDemand]: 257/273 looper letters, 78 selfloop transitions, 12 changer transitions 0/115 dead transitions. [2023-08-25 22:17:34,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 115 transitions, 425 flow [2023-08-25 22:17:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-25 22:17:34,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884004884004884 [2023-08-25 22:17:34,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-25 22:17:34,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-25 22:17:34,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:34,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-25 22:17:34,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,552 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 156 flow. Second operand 3 states and 400 transitions. [2023-08-25 22:17:34,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 115 transitions, 425 flow [2023-08-25 22:17:34,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:34,554 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 260 flow [2023-08-25 22:17:34,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2023-08-25 22:17:34,555 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -14 predicate places. [2023-08-25 22:17:34,555 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 260 flow [2023-08-25 22:17:34,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:34,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:34,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 22:17:34,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:34,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:34,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1437628325, now seen corresponding path program 1 times [2023-08-25 22:17:34,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:34,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896026811] [2023-08-25 22:17:34,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:34,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896026811] [2023-08-25 22:17:34,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896026811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998333728] [2023-08-25 22:17:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:34,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:34,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:34,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 273 [2023-08-25 22:17:34,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:34,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 273 [2023-08-25 22:17:34,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:34,864 INFO L124 PetriNetUnfolderBase]: 1930/3985 cut-off events. [2023-08-25 22:17:34,864 INFO L125 PetriNetUnfolderBase]: For 1117/1121 co-relation queries the response was YES. [2023-08-25 22:17:34,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8560 conditions, 3985 events. 1930/3985 cut-off events. For 1117/1121 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 30759 event pairs, 1430 based on Foata normal form. 0/3505 useless extension candidates. Maximal degree in co-relation 8553. Up to 2989 conditions per place. [2023-08-25 22:17:34,882 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 80 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2023-08-25 22:17:34,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 551 flow [2023-08-25 22:17:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-25 22:17:34,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542124542124542 [2023-08-25 22:17:34,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-25 22:17:34,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-25 22:17:34,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:34,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-25 22:17:34,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,887 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 260 flow. Second operand 3 states and 372 transitions. [2023-08-25 22:17:34,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 551 flow [2023-08-25 22:17:34,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 116 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:34,891 INFO L231 Difference]: Finished difference. Result has 83 places, 94 transitions, 334 flow [2023-08-25 22:17:34,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=83, PETRI_TRANSITIONS=94} [2023-08-25 22:17:34,892 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -12 predicate places. [2023-08-25 22:17:34,892 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 94 transitions, 334 flow [2023-08-25 22:17:34,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:34,892 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:34,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 22:17:34,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:34,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1302402851, now seen corresponding path program 1 times [2023-08-25 22:17:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462186998] [2023-08-25 22:17:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462186998] [2023-08-25 22:17:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462186998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449556675] [2023-08-25 22:17:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:34,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:34,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:34,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:34,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 273 [2023-08-25 22:17:34,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 94 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:34,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:34,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 273 [2023-08-25 22:17:34,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:35,188 INFO L124 PetriNetUnfolderBase]: 1975/4102 cut-off events. [2023-08-25 22:17:35,188 INFO L125 PetriNetUnfolderBase]: For 1553/1569 co-relation queries the response was YES. [2023-08-25 22:17:35,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9129 conditions, 4102 events. 1975/4102 cut-off events. For 1553/1569 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 31885 event pairs, 1422 based on Foata normal form. 0/3646 useless extension candidates. Maximal degree in co-relation 9121. Up to 3069 conditions per place. [2023-08-25 22:17:35,207 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 87 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2023-08-25 22:17:35,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 127 transitions, 664 flow [2023-08-25 22:17:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-25 22:17:35,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.452991452991453 [2023-08-25 22:17:35,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-25 22:17:35,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-25 22:17:35,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:35,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-25 22:17:35,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,211 INFO L175 Difference]: Start difference. First operand has 83 places, 94 transitions, 334 flow. Second operand 3 states and 371 transitions. [2023-08-25 22:17:35,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 127 transitions, 664 flow [2023-08-25 22:17:35,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:35,214 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 450 flow [2023-08-25 22:17:35,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2023-08-25 22:17:35,215 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -10 predicate places. [2023-08-25 22:17:35,215 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 450 flow [2023-08-25 22:17:35,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:35,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:35,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 22:17:35,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:35,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1981733340, now seen corresponding path program 1 times [2023-08-25 22:17:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:35,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992374252] [2023-08-25 22:17:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:35,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:17:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992374252] [2023-08-25 22:17:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992374252] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:17:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268668331] [2023-08-25 22:17:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:35,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:35,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-25 22:17:35,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:35,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-25 22:17:35,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:35,353 INFO L124 PetriNetUnfolderBase]: 412/1118 cut-off events. [2023-08-25 22:17:35,353 INFO L125 PetriNetUnfolderBase]: For 416/428 co-relation queries the response was YES. [2023-08-25 22:17:35,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 1118 events. 412/1118 cut-off events. For 416/428 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7496 event pairs, 159 based on Foata normal form. 72/1137 useless extension candidates. Maximal degree in co-relation 2294. Up to 523 conditions per place. [2023-08-25 22:17:35,357 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 34 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2023-08-25 22:17:35,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 315 flow [2023-08-25 22:17:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-25 22:17:35,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514041514041514 [2023-08-25 22:17:35,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-25 22:17:35,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-25 22:17:35,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:35,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-25 22:17:35,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,362 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 450 flow. Second operand 3 states and 421 transitions. [2023-08-25 22:17:35,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 315 flow [2023-08-25 22:17:35,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 275 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-25 22:17:35,364 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 184 flow [2023-08-25 22:17:35,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2023-08-25 22:17:35,364 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -20 predicate places. [2023-08-25 22:17:35,364 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 184 flow [2023-08-25 22:17:35,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:35,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:35,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 22:17:35,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:35,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1418577249, now seen corresponding path program 1 times [2023-08-25 22:17:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:35,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165522856] [2023-08-25 22:17:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:35,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:35,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165522856] [2023-08-25 22:17:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165522856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:35,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250950488] [2023-08-25 22:17:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:35,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:35,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 273 [2023-08-25 22:17:35,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:35,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 273 [2023-08-25 22:17:35,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:35,560 INFO L124 PetriNetUnfolderBase]: 1180/2293 cut-off events. [2023-08-25 22:17:35,560 INFO L125 PetriNetUnfolderBase]: For 312/328 co-relation queries the response was YES. [2023-08-25 22:17:35,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4919 conditions, 2293 events. 1180/2293 cut-off events. For 312/328 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15809 event pairs, 554 based on Foata normal form. 0/2042 useless extension candidates. Maximal degree in co-relation 4912. Up to 1313 conditions per place. [2023-08-25 22:17:35,567 INFO L140 encePairwiseOnDemand]: 263/273 looper letters, 80 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2023-08-25 22:17:35,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 475 flow [2023-08-25 22:17:35,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-25 22:17:35,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2023-08-25 22:17:35,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-25 22:17:35,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-25 22:17:35,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:35,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-25 22:17:35,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,571 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 184 flow. Second operand 3 states and 414 transitions. [2023-08-25 22:17:35,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 475 flow [2023-08-25 22:17:35,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:17:35,573 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 244 flow [2023-08-25 22:17:35,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2023-08-25 22:17:35,574 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -17 predicate places. [2023-08-25 22:17:35,574 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 244 flow [2023-08-25 22:17:35,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:35,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:35,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 22:17:35,574 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:35,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1418621488, now seen corresponding path program 1 times [2023-08-25 22:17:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696881149] [2023-08-25 22:17:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:35,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696881149] [2023-08-25 22:17:35,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696881149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:35,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:35,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86797697] [2023-08-25 22:17:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:35,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:35,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 273 [2023-08-25 22:17:35,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:35,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 273 [2023-08-25 22:17:35,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:35,742 INFO L124 PetriNetUnfolderBase]: 1174/2301 cut-off events. [2023-08-25 22:17:35,742 INFO L125 PetriNetUnfolderBase]: For 755/771 co-relation queries the response was YES. [2023-08-25 22:17:35,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5464 conditions, 2301 events. 1174/2301 cut-off events. For 755/771 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15775 event pairs, 972 based on Foata normal form. 0/2098 useless extension candidates. Maximal degree in co-relation 5455. Up to 2059 conditions per place. [2023-08-25 22:17:35,750 INFO L140 encePairwiseOnDemand]: 268/273 looper letters, 60 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2023-08-25 22:17:35,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 421 flow [2023-08-25 22:17:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-25 22:17:35,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4554334554334554 [2023-08-25 22:17:35,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-25 22:17:35,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-25 22:17:35,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:35,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-25 22:17:35,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,754 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 244 flow. Second operand 3 states and 373 transitions. [2023-08-25 22:17:35,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 421 flow [2023-08-25 22:17:35,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 399 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:35,757 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 270 flow [2023-08-25 22:17:35,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2023-08-25 22:17:35,757 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -16 predicate places. [2023-08-25 22:17:35,758 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 270 flow [2023-08-25 22:17:35,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:35,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:35,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 22:17:35,758 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:35,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash -322452675, now seen corresponding path program 1 times [2023-08-25 22:17:35,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:35,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399466139] [2023-08-25 22:17:35,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:35,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399466139] [2023-08-25 22:17:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399466139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:35,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:35,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684211618] [2023-08-25 22:17:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:35,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:35,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:35,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:35,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 273 [2023-08-25 22:17:35,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:35,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 273 [2023-08-25 22:17:35,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:35,895 INFO L124 PetriNetUnfolderBase]: 749/1714 cut-off events. [2023-08-25 22:17:35,895 INFO L125 PetriNetUnfolderBase]: For 374/388 co-relation queries the response was YES. [2023-08-25 22:17:35,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 1714 events. 749/1714 cut-off events. For 374/388 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12090 event pairs, 612 based on Foata normal form. 2/1617 useless extension candidates. Maximal degree in co-relation 3834. Up to 1335 conditions per place. [2023-08-25 22:17:35,901 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 53 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-25 22:17:35,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 87 transitions, 405 flow [2023-08-25 22:17:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-25 22:17:35,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42124542124542125 [2023-08-25 22:17:35,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-25 22:17:35,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-25 22:17:35,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:35,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-25 22:17:35,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,904 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 270 flow. Second operand 3 states and 345 transitions. [2023-08-25 22:17:35,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 87 transitions, 405 flow [2023-08-25 22:17:35,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:17:35,906 INFO L231 Difference]: Finished difference. Result has 79 places, 80 transitions, 266 flow [2023-08-25 22:17:35,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2023-08-25 22:17:35,907 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -16 predicate places. [2023-08-25 22:17:35,907 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 266 flow [2023-08-25 22:17:35,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:35,907 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:35,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 22:17:35,908 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:35,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1044241149, now seen corresponding path program 1 times [2023-08-25 22:17:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:35,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169094440] [2023-08-25 22:17:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:35,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169094440] [2023-08-25 22:17:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169094440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:35,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118523183] [2023-08-25 22:17:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:35,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 273 [2023-08-25 22:17:35,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:35,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:35,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 273 [2023-08-25 22:17:35,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:36,085 INFO L124 PetriNetUnfolderBase]: 1170/2261 cut-off events. [2023-08-25 22:17:36,086 INFO L125 PetriNetUnfolderBase]: For 583/599 co-relation queries the response was YES. [2023-08-25 22:17:36,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5415 conditions, 2261 events. 1170/2261 cut-off events. For 583/599 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15311 event pairs, 952 based on Foata normal form. 0/2030 useless extension candidates. Maximal degree in co-relation 5405. Up to 2055 conditions per place. [2023-08-25 22:17:36,092 INFO L140 encePairwiseOnDemand]: 268/273 looper letters, 63 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2023-08-25 22:17:36,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 436 flow [2023-08-25 22:17:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-25 22:17:36,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542124542124542 [2023-08-25 22:17:36,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-25 22:17:36,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-25 22:17:36,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:36,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-25 22:17:36,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,095 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 266 flow. Second operand 3 states and 372 transitions. [2023-08-25 22:17:36,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 436 flow [2023-08-25 22:17:36,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 91 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:36,097 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 304 flow [2023-08-25 22:17:36,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2023-08-25 22:17:36,098 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -15 predicate places. [2023-08-25 22:17:36,098 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 304 flow [2023-08-25 22:17:36,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:36,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:36,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 22:17:36,099 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:36,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:36,099 INFO L85 PathProgramCache]: Analyzing trace with hash 627209524, now seen corresponding path program 1 times [2023-08-25 22:17:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868513122] [2023-08-25 22:17:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:36,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868513122] [2023-08-25 22:17:36,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868513122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:36,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:36,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034851874] [2023-08-25 22:17:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:36,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:36,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:36,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:36,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 273 [2023-08-25 22:17:36,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:36,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 273 [2023-08-25 22:17:36,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:36,299 INFO L124 PetriNetUnfolderBase]: 1184/2297 cut-off events. [2023-08-25 22:17:36,299 INFO L125 PetriNetUnfolderBase]: For 778/792 co-relation queries the response was YES. [2023-08-25 22:17:36,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5651 conditions, 2297 events. 1184/2297 cut-off events. For 778/792 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15653 event pairs, 828 based on Foata normal form. 0/2100 useless extension candidates. Maximal degree in co-relation 5640. Up to 1845 conditions per place. [2023-08-25 22:17:36,307 INFO L140 encePairwiseOnDemand]: 266/273 looper letters, 80 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2023-08-25 22:17:36,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 112 transitions, 586 flow [2023-08-25 22:17:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-25 22:17:36,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725274725274725 [2023-08-25 22:17:36,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-25 22:17:36,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-25 22:17:36,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:36,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-25 22:17:36,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,311 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 304 flow. Second operand 3 states and 387 transitions. [2023-08-25 22:17:36,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 112 transitions, 586 flow [2023-08-25 22:17:36,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:17:36,314 INFO L231 Difference]: Finished difference. Result has 83 places, 90 transitions, 381 flow [2023-08-25 22:17:36,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2023-08-25 22:17:36,314 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -12 predicate places. [2023-08-25 22:17:36,314 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 381 flow [2023-08-25 22:17:36,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:36,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:36,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 22:17:36,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:36,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1406096155, now seen corresponding path program 1 times [2023-08-25 22:17:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474989180] [2023-08-25 22:17:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:36,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474989180] [2023-08-25 22:17:36,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474989180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:36,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:36,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 22:17:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605613436] [2023-08-25 22:17:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:36,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 22:17:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 22:17:36,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 22:17:36,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-08-25 22:17:36,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:36,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-08-25 22:17:36,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:36,554 INFO L124 PetriNetUnfolderBase]: 816/1840 cut-off events. [2023-08-25 22:17:36,554 INFO L125 PetriNetUnfolderBase]: For 1402/1446 co-relation queries the response was YES. [2023-08-25 22:17:36,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 1840 events. 816/1840 cut-off events. For 1402/1446 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 13112 event pairs, 211 based on Foata normal form. 8/1779 useless extension candidates. Maximal degree in co-relation 4628. Up to 980 conditions per place. [2023-08-25 22:17:36,562 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 82 selfloop transitions, 8 changer transitions 0/127 dead transitions. [2023-08-25 22:17:36,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 710 flow [2023-08-25 22:17:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:17:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:17:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2023-08-25 22:17:36,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609279609279609 [2023-08-25 22:17:36,565 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 755 transitions. [2023-08-25 22:17:36,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 755 transitions. [2023-08-25 22:17:36,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:36,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 755 transitions. [2023-08-25 22:17:36,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,568 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,568 INFO L175 Difference]: Start difference. First operand has 83 places, 90 transitions, 381 flow. Second operand 6 states and 755 transitions. [2023-08-25 22:17:36,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 710 flow [2023-08-25 22:17:36,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 674 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:36,573 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 398 flow [2023-08-25 22:17:36,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2023-08-25 22:17:36,574 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2023-08-25 22:17:36,574 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 398 flow [2023-08-25 22:17:36,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:36,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:36,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 22:17:36,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:36,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1452962721, now seen corresponding path program 1 times [2023-08-25 22:17:36,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:36,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663437657] [2023-08-25 22:17:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:36,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663437657] [2023-08-25 22:17:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663437657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:17:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337536688] [2023-08-25 22:17:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:36,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:17:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:17:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 22:17:36,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 273 [2023-08-25 22:17:36,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 398 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:36,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 273 [2023-08-25 22:17:36,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:36,842 INFO L124 PetriNetUnfolderBase]: 498/1275 cut-off events. [2023-08-25 22:17:36,842 INFO L125 PetriNetUnfolderBase]: For 559/597 co-relation queries the response was YES. [2023-08-25 22:17:36,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 1275 events. 498/1275 cut-off events. For 559/597 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9026 event pairs, 192 based on Foata normal form. 60/1286 useless extension candidates. Maximal degree in co-relation 3084. Up to 522 conditions per place. [2023-08-25 22:17:36,846 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 79 selfloop transitions, 7 changer transitions 0/134 dead transitions. [2023-08-25 22:17:36,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 134 transitions, 704 flow [2023-08-25 22:17:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 22:17:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 22:17:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-25 22:17:36,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47545787545787543 [2023-08-25 22:17:36,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-25 22:17:36,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-25 22:17:36,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:36,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-25 22:17:36,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 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-08-25 22:17:36,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,851 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,851 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 398 flow. Second operand 5 states and 649 transitions. [2023-08-25 22:17:36,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 134 transitions, 704 flow [2023-08-25 22:17:36,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 684 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-25 22:17:36,855 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 402 flow [2023-08-25 22:17:36,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2023-08-25 22:17:36,855 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2023-08-25 22:17:36,855 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 402 flow [2023-08-25 22:17:36,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:36,856 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:36,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 22:17:36,856 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:36,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash -535712430, now seen corresponding path program 1 times [2023-08-25 22:17:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:36,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322420267] [2023-08-25 22:17:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322420267] [2023-08-25 22:17:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322420267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:36,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555255795] [2023-08-25 22:17:36,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:36,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:36,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 273 [2023-08-25 22:17:36,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:36,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 273 [2023-08-25 22:17:36,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:36,990 INFO L124 PetriNetUnfolderBase]: 601/1412 cut-off events. [2023-08-25 22:17:36,991 INFO L125 PetriNetUnfolderBase]: For 674/712 co-relation queries the response was YES. [2023-08-25 22:17:36,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3702 conditions, 1412 events. 601/1412 cut-off events. For 674/712 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9822 event pairs, 467 based on Foata normal form. 16/1379 useless extension candidates. Maximal degree in co-relation 3685. Up to 1100 conditions per place. [2023-08-25 22:17:36,995 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 58 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2023-08-25 22:17:36,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 98 transitions, 548 flow [2023-08-25 22:17:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-25 22:17:36,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175824175824176 [2023-08-25 22:17:36,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-25 22:17:36,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-25 22:17:36,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:36,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-25 22:17:36,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:36,999 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 402 flow. Second operand 3 states and 342 transitions. [2023-08-25 22:17:36,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 98 transitions, 548 flow [2023-08-25 22:17:37,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 98 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:37,003 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 404 flow [2023-08-25 22:17:37,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2023-08-25 22:17:37,003 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2023-08-25 22:17:37,004 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 404 flow [2023-08-25 22:17:37,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:37,004 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:37,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 22:17:37,004 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:37,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash 572788927, now seen corresponding path program 1 times [2023-08-25 22:17:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300376560] [2023-08-25 22:17:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:37,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300376560] [2023-08-25 22:17:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300376560] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:37,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:37,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 22:17:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238415244] [2023-08-25 22:17:37,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:37,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 22:17:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 22:17:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 22:17:37,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-08-25 22:17:37,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:37,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-08-25 22:17:37,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:37,212 INFO L124 PetriNetUnfolderBase]: 593/1342 cut-off events. [2023-08-25 22:17:37,212 INFO L125 PetriNetUnfolderBase]: For 692/732 co-relation queries the response was YES. [2023-08-25 22:17:37,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 1342 events. 593/1342 cut-off events. For 692/732 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9127 event pairs, 160 based on Foata normal form. 16/1319 useless extension candidates. Maximal degree in co-relation 3597. Up to 619 conditions per place. [2023-08-25 22:17:37,217 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 80 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2023-08-25 22:17:37,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 692 flow [2023-08-25 22:17:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:17:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:17:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-25 22:17:37,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4590964590964591 [2023-08-25 22:17:37,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-25 22:17:37,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-25 22:17:37,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:37,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-25 22:17:37,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,223 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,223 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 404 flow. Second operand 6 states and 752 transitions. [2023-08-25 22:17:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 692 flow [2023-08-25 22:17:37,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 123 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:37,227 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 435 flow [2023-08-25 22:17:37,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=435, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2023-08-25 22:17:37,227 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 7 predicate places. [2023-08-25 22:17:37,228 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 435 flow [2023-08-25 22:17:37,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:37,228 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:37,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 22:17:37,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:37,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -775436735, now seen corresponding path program 1 times [2023-08-25 22:17:37,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:37,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666642576] [2023-08-25 22:17:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666642576] [2023-08-25 22:17:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666642576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:37,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944458838] [2023-08-25 22:17:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:37,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:37,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 273 [2023-08-25 22:17:37,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:37,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 273 [2023-08-25 22:17:37,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:37,402 INFO L124 PetriNetUnfolderBase]: 852/1747 cut-off events. [2023-08-25 22:17:37,402 INFO L125 PetriNetUnfolderBase]: For 1081/1087 co-relation queries the response was YES. [2023-08-25 22:17:37,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 1747 events. 852/1747 cut-off events. For 1081/1087 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11800 event pairs, 630 based on Foata normal form. 0/1628 useless extension candidates. Maximal degree in co-relation 4785. Up to 1457 conditions per place. [2023-08-25 22:17:37,409 INFO L140 encePairwiseOnDemand]: 268/273 looper letters, 81 selfloop transitions, 7 changer transitions 0/113 dead transitions. [2023-08-25 22:17:37,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 113 transitions, 684 flow [2023-08-25 22:17:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-25 22:17:37,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463980463980464 [2023-08-25 22:17:37,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-25 22:17:37,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-25 22:17:37,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:37,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-25 22:17:37,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,412 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 435 flow. Second operand 3 states and 380 transitions. [2023-08-25 22:17:37,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 113 transitions, 684 flow [2023-08-25 22:17:37,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 113 transitions, 674 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:37,416 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 469 flow [2023-08-25 22:17:37,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2023-08-25 22:17:37,416 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 8 predicate places. [2023-08-25 22:17:37,416 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 469 flow [2023-08-25 22:17:37,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:37,417 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-08-25 22:17:37,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 22:17:37,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:37,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2129751215, now seen corresponding path program 1 times [2023-08-25 22:17:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:37,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628917526] [2023-08-25 22:17:37,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:37,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628917526] [2023-08-25 22:17:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628917526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:17:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086390048] [2023-08-25 22:17:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:17:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:17:37,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 22:17:37,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 273 [2023-08-25 22:17:37,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 469 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:37,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 273 [2023-08-25 22:17:37,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:37,637 INFO L124 PetriNetUnfolderBase]: 355/876 cut-off events. [2023-08-25 22:17:37,637 INFO L125 PetriNetUnfolderBase]: For 663/709 co-relation queries the response was YES. [2023-08-25 22:17:37,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 876 events. 355/876 cut-off events. For 663/709 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5430 event pairs, 136 based on Foata normal form. 44/885 useless extension candidates. Maximal degree in co-relation 2411. Up to 390 conditions per place. [2023-08-25 22:17:37,640 INFO L140 encePairwiseOnDemand]: 267/273 looper letters, 62 selfloop transitions, 8 changer transitions 4/121 dead transitions. [2023-08-25 22:17:37,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 121 transitions, 688 flow [2023-08-25 22:17:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 22:17:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 22:17:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-25 22:17:37,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644688644688645 [2023-08-25 22:17:37,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-25 22:17:37,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-25 22:17:37,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:37,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-25 22:17:37,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,646 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,646 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 469 flow. Second operand 5 states and 634 transitions. [2023-08-25 22:17:37,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 121 transitions, 688 flow [2023-08-25 22:17:37,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 121 transitions, 672 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:37,650 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 465 flow [2023-08-25 22:17:37,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2023-08-25 22:17:37,651 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2023-08-25 22:17:37,651 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 465 flow [2023-08-25 22:17:37,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:37,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:37,651 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 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-08-25 22:17:37,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-25 22:17:37,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:37,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1437870839, now seen corresponding path program 1 times [2023-08-25 22:17:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61163303] [2023-08-25 22:17:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:17:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61163303] [2023-08-25 22:17:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61163303] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:17:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107992809] [2023-08-25 22:17:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:17:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:17:37,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:17:37,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 22:17:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:37,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-25 22:17:37,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:17:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:17:37,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:17:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:17:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107992809] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:17:38,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:17:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-25 22:17:38,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293882088] [2023-08-25 22:17:38,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:17:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 22:17:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 22:17:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-25 22:17:38,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 273 [2023-08-25 22:17:38,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 465 flow. Second operand has 13 states, 13 states have (on average 114.38461538461539) internal successors, (1487), 13 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:38,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 273 [2023-08-25 22:17:38,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:38,317 INFO L124 PetriNetUnfolderBase]: 252/618 cut-off events. [2023-08-25 22:17:38,317 INFO L125 PetriNetUnfolderBase]: For 522/546 co-relation queries the response was YES. [2023-08-25 22:17:38,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 618 events. 252/618 cut-off events. For 522/546 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3350 event pairs, 53 based on Foata normal form. 10/611 useless extension candidates. Maximal degree in co-relation 1750. Up to 175 conditions per place. [2023-08-25 22:17:38,319 INFO L140 encePairwiseOnDemand]: 262/273 looper letters, 43 selfloop transitions, 7 changer transitions 37/107 dead transitions. [2023-08-25 22:17:38,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 634 flow [2023-08-25 22:17:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 22:17:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 22:17:38,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1518 transitions. [2023-08-25 22:17:38,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42772612003381233 [2023-08-25 22:17:38,322 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1518 transitions. [2023-08-25 22:17:38,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1518 transitions. [2023-08-25 22:17:38,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:38,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1518 transitions. [2023-08-25 22:17:38,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.76923076923077) internal successors, (1518), 13 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,329 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 273.0) internal successors, (3822), 14 states have internal predecessors, (3822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,329 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 465 flow. Second operand 13 states and 1518 transitions. [2023-08-25 22:17:38,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 634 flow [2023-08-25 22:17:38,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 603 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-25 22:17:38,331 INFO L231 Difference]: Finished difference. Result has 98 places, 57 transitions, 264 flow [2023-08-25 22:17:38,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=264, PETRI_PLACES=98, PETRI_TRANSITIONS=57} [2023-08-25 22:17:38,332 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2023-08-25 22:17:38,332 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 57 transitions, 264 flow [2023-08-25 22:17:38,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 114.38461538461539) internal successors, (1487), 13 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:38,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 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-08-25 22:17:38,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 22:17:38,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:17:38,538 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err8ASSERT_VIOLATIONDATA_RACE, thr1Err12ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT (and 44 more)] === [2023-08-25 22:17:38,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 122720988, now seen corresponding path program 1 times [2023-08-25 22:17:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:38,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125467708] [2023-08-25 22:17:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125467708] [2023-08-25 22:17:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125467708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 22:17:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860645238] [2023-08-25 22:17:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:38,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 22:17:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:38,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 22:17:38,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-25 22:17:38,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 273 [2023-08-25 22:17:38,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 57 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:38,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 273 [2023-08-25 22:17:38,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:38,705 INFO L124 PetriNetUnfolderBase]: 36/118 cut-off events. [2023-08-25 22:17:38,705 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-25 22:17:38,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 118 events. 36/118 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 359 event pairs, 6 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 304. Up to 26 conditions per place. [2023-08-25 22:17:38,706 INFO L140 encePairwiseOnDemand]: 265/273 looper letters, 0 selfloop transitions, 0 changer transitions 40/40 dead transitions. [2023-08-25 22:17:38,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 40 transitions, 215 flow [2023-08-25 22:17:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 22:17:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 22:17:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1029 transitions. [2023-08-25 22:17:38,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2023-08-25 22:17:38,708 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1029 transitions. [2023-08-25 22:17:38,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1029 transitions. [2023-08-25 22:17:38,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:38,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1029 transitions. [2023-08-25 22:17:38,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,713 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,713 INFO L175 Difference]: Start difference. First operand has 98 places, 57 transitions, 264 flow. Second operand 9 states and 1029 transitions. [2023-08-25 22:17:38,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 40 transitions, 215 flow [2023-08-25 22:17:38,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 163 flow, removed 4 selfloop flow, removed 21 redundant places. [2023-08-25 22:17:38,714 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2023-08-25 22:17:38,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2023-08-25 22:17:38,714 INFO L281 CegarLoopForPetriNet]: 95 programPoint places, -45 predicate places. [2023-08-25 22:17:38,714 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2023-08-25 22:17:38,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (47 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONASSERT (44 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (41 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONASSERT (40 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONASSERT (37 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2023-08-25 22:17:38,718 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 48 remaining) [2023-08-25 22:17:38,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (18 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2023-08-25 22:17:38,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2023-08-25 22:17:38,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2023-08-25 22:17:38,721 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2023-08-25 22:17:38,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2023-08-25 22:17:38,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-25 22:17:38,722 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:38,723 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-25 22:17:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:38,736 INFO L124 PetriNetUnfolderBase]: 11/186 cut-off events. [2023-08-25 22:17:38,736 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:17:38,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 11/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 475 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2023-08-25 22:17:38,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:38,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:38,737 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:17:38,737 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:38,738 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:38,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 164 transitions, 340 flow [2023-08-25 22:17:38,745 INFO L124 PetriNetUnfolderBase]: 11/186 cut-off events. [2023-08-25 22:17:38,746 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:17:38,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 11/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 475 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2023-08-25 22:17:38,750 INFO L119 LiptonReduction]: Number of co-enabled transitions 12920 [2023-08-25 22:17:39,740 INFO L134 LiptonReduction]: Checked pairs total: 50719 [2023-08-25 22:17:39,740 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-25 22:17:39,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-25 22:17:39,741 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@45281181, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:17:39,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-25 22:17:39,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:17:39,743 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-08-25 22:17:39,743 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 22:17:39,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:39,743 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-25 22:17:39,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-25 22:17:39,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash -250741870, now seen corresponding path program 1 times [2023-08-25 22:17:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182016725] [2023-08-25 22:17:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:17:39,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 22:17:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 22:17:39,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 22:17:39,758 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 22:17:39,760 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-25 22:17:39,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-25 22:17:39,760 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-25 22:17:39,760 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-25 22:17:39,760 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 22:17:39,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-25 22:17:39,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:17:39,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 233 transitions, 487 flow [2023-08-25 22:17:39,798 INFO L124 PetriNetUnfolderBase]: 16/267 cut-off events. [2023-08-25 22:17:39,798 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-25 22:17:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 267 events. 16/267 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 893 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 216. Up to 8 conditions per place. [2023-08-25 22:17:39,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 233 transitions, 487 flow [2023-08-25 22:17:39,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 233 transitions, 487 flow [2023-08-25 22:17:39,801 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:17:39,801 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 233 transitions, 487 flow [2023-08-25 22:17:39,802 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 233 transitions, 487 flow [2023-08-25 22:17:39,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 233 transitions, 487 flow [2023-08-25 22:17:39,817 INFO L124 PetriNetUnfolderBase]: 16/267 cut-off events. [2023-08-25 22:17:39,817 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-25 22:17:39,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 267 events. 16/267 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 893 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 216. Up to 8 conditions per place. [2023-08-25 22:17:39,828 INFO L119 LiptonReduction]: Number of co-enabled transitions 33456 [2023-08-25 22:17:41,071 INFO L134 LiptonReduction]: Checked pairs total: 142474 [2023-08-25 22:17:41,071 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-08-25 22:17:41,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:17:41,072 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@45281181, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:17:41,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-08-25 22:17:41,073 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:17:41,073 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-08-25 22:17:41,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:17:41,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:41,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 22:17:41,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:17:41,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 50806818, now seen corresponding path program 1 times [2023-08-25 22:17:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835685122] [2023-08-25 22:17:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835685122] [2023-08-25 22:17:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835685122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:41,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:17:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219559462] [2023-08-25 22:17:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:41,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:17:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:17:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:17:41,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 395 [2023-08-25 22:17:41,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 291 flow. Second operand has 2 states, 2 states have (on average 179.0) internal successors, (358), 2 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:41,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:41,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 395 [2023-08-25 22:17:41,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:42,685 INFO L124 PetriNetUnfolderBase]: 16619/28421 cut-off events. [2023-08-25 22:17:42,685 INFO L125 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2023-08-25 22:17:42,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52715 conditions, 28421 events. 16619/28421 cut-off events. For 1324/1324 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 241909 event pairs, 15269 based on Foata normal form. 0/26253 useless extension candidates. Maximal degree in co-relation 32835. Up to 23370 conditions per place. [2023-08-25 22:17:42,818 INFO L140 encePairwiseOnDemand]: 367/395 looper letters, 49 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2023-08-25 22:17:42,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 333 flow [2023-08-25 22:17:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:17:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:17:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 431 transitions. [2023-08-25 22:17:42,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5455696202531646 [2023-08-25 22:17:42,820 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 431 transitions. [2023-08-25 22:17:42,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 431 transitions. [2023-08-25 22:17:42,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:42,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 431 transitions. [2023-08-25 22:17:42,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:42,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:42,823 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:42,823 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 291 flow. Second operand 2 states and 431 transitions. [2023-08-25 22:17:42,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 333 flow [2023-08-25 22:17:42,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 107 transitions, 327 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:42,824 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 229 flow [2023-08-25 22:17:42,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=229, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2023-08-25 22:17:42,825 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -27 predicate places. [2023-08-25 22:17:42,825 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 229 flow [2023-08-25 22:17:42,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 179.0) internal successors, (358), 2 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:42,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:42,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 22:17:42,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-25 22:17:42,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:17:42,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1580753346, now seen corresponding path program 1 times [2023-08-25 22:17:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737793228] [2023-08-25 22:17:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737793228] [2023-08-25 22:17:42,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737793228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:42,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:42,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30792215] [2023-08-25 22:17:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:42,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:42,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 395 [2023-08-25 22:17:42,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:42,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:42,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 395 [2023-08-25 22:17:42,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:49,660 INFO L124 PetriNetUnfolderBase]: 82045/136115 cut-off events. [2023-08-25 22:17:49,661 INFO L125 PetriNetUnfolderBase]: For 2026/2026 co-relation queries the response was YES. [2023-08-25 22:17:49,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255762 conditions, 136115 events. 82045/136115 cut-off events. For 2026/2026 co-relation queries the response was YES. Maximal size of possible extension queue 4085. Compared 1333770 event pairs, 30624 based on Foata normal form. 0/115718 useless extension candidates. Maximal degree in co-relation 255756. Up to 68321 conditions per place. [2023-08-25 22:17:50,290 INFO L140 encePairwiseOnDemand]: 371/395 looper letters, 116 selfloop transitions, 18 changer transitions 0/170 dead transitions. [2023-08-25 22:17:50,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 170 transitions, 633 flow [2023-08-25 22:17:50,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2023-08-25 22:17:50,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751054852320675 [2023-08-25 22:17:50,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2023-08-25 22:17:50,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2023-08-25 22:17:50,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:50,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2023-08-25 22:17:50,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:50,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:50,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:50,294 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 229 flow. Second operand 3 states and 563 transitions. [2023-08-25 22:17:50,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 170 transitions, 633 flow [2023-08-25 22:17:50,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 170 transitions, 633 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:17:50,297 INFO L231 Difference]: Finished difference. Result has 116 places, 125 transitions, 385 flow [2023-08-25 22:17:50,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=116, PETRI_TRANSITIONS=125} [2023-08-25 22:17:50,297 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -23 predicate places. [2023-08-25 22:17:50,297 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 125 transitions, 385 flow [2023-08-25 22:17:50,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:50,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:50,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:50,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-25 22:17:50,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:17:50,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash -431038075, now seen corresponding path program 1 times [2023-08-25 22:17:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:50,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660463013] [2023-08-25 22:17:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:17:50,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660463013] [2023-08-25 22:17:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660463013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:50,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:50,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720967669] [2023-08-25 22:17:50,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:50,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:50,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 395 [2023-08-25 22:17:50,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 125 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:50,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:50,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 395 [2023-08-25 22:17:50,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:17:58,488 INFO L124 PetriNetUnfolderBase]: 87052/139772 cut-off events. [2023-08-25 22:17:58,488 INFO L125 PetriNetUnfolderBase]: For 47108/47464 co-relation queries the response was YES. [2023-08-25 22:17:58,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314340 conditions, 139772 events. 87052/139772 cut-off events. For 47108/47464 co-relation queries the response was YES. Maximal size of possible extension queue 4205. Compared 1313555 event pairs, 61790 based on Foata normal form. 48/122502 useless extension candidates. Maximal degree in co-relation 314332. Up to 112631 conditions per place. [2023-08-25 22:17:59,168 INFO L140 encePairwiseOnDemand]: 383/395 looper letters, 130 selfloop transitions, 21 changer transitions 0/187 dead transitions. [2023-08-25 22:17:59,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 187 transitions, 907 flow [2023-08-25 22:17:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:17:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:17:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2023-08-25 22:17:59,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45147679324894513 [2023-08-25 22:17:59,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2023-08-25 22:17:59,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2023-08-25 22:17:59,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:17:59,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2023-08-25 22:17:59,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:59,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:59,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:59,173 INFO L175 Difference]: Start difference. First operand has 116 places, 125 transitions, 385 flow. Second operand 3 states and 535 transitions. [2023-08-25 22:17:59,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 187 transitions, 907 flow [2023-08-25 22:17:59,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 187 transitions, 845 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:17:59,248 INFO L231 Difference]: Finished difference. Result has 118 places, 144 transitions, 547 flow [2023-08-25 22:17:59,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=547, PETRI_PLACES=118, PETRI_TRANSITIONS=144} [2023-08-25 22:17:59,249 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -21 predicate places. [2023-08-25 22:17:59,249 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 144 transitions, 547 flow [2023-08-25 22:17:59,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:59,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:17:59,249 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:17:59,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-25 22:17:59,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:17:59,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:17:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash -342191574, now seen corresponding path program 1 times [2023-08-25 22:17:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:17:59,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893847916] [2023-08-25 22:17:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:17:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:17:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:17:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:17:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:17:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893847916] [2023-08-25 22:17:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893847916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:17:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:17:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:17:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322725074] [2023-08-25 22:17:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:17:59,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:17:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:17:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:17:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:17:59,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 395 [2023-08-25 22:17:59,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 144 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:17:59,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:17:59,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 395 [2023-08-25 22:17:59,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:07,995 INFO L124 PetriNetUnfolderBase]: 91849/148625 cut-off events. [2023-08-25 22:18:07,995 INFO L125 PetriNetUnfolderBase]: For 72313/73091 co-relation queries the response was YES. [2023-08-25 22:18:08,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348568 conditions, 148625 events. 91849/148625 cut-off events. For 72313/73091 co-relation queries the response was YES. Maximal size of possible extension queue 4499. Compared 1417401 event pairs, 63294 based on Foata normal form. 48/128917 useless extension candidates. Maximal degree in co-relation 348559. Up to 118983 conditions per place. [2023-08-25 22:18:08,918 INFO L140 encePairwiseOnDemand]: 383/395 looper letters, 147 selfloop transitions, 33 changer transitions 0/216 dead transitions. [2023-08-25 22:18:08,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 216 transitions, 1216 flow [2023-08-25 22:18:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-25 22:18:08,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4506329113924051 [2023-08-25 22:18:08,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-25 22:18:08,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-25 22:18:08,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:08,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-25 22:18:08,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:08,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:08,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:08,922 INFO L175 Difference]: Start difference. First operand has 118 places, 144 transitions, 547 flow. Second operand 3 states and 534 transitions. [2023-08-25 22:18:08,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 216 transitions, 1216 flow [2023-08-25 22:18:09,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 1148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:09,226 INFO L231 Difference]: Finished difference. Result has 120 places, 173 transitions, 859 flow [2023-08-25 22:18:09,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=120, PETRI_TRANSITIONS=173} [2023-08-25 22:18:09,226 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -19 predicate places. [2023-08-25 22:18:09,227 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 173 transitions, 859 flow [2023-08-25 22:18:09,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:09,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:09,227 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:09,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-25 22:18:09,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:09,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1716374167, now seen corresponding path program 1 times [2023-08-25 22:18:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2757523] [2023-08-25 22:18:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:18:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2757523] [2023-08-25 22:18:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2757523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:09,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:18:09,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141013093] [2023-08-25 22:18:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:09,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:09,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 395 [2023-08-25 22:18:09,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 173 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:09,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:09,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 395 [2023-08-25 22:18:09,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:10,086 INFO L124 PetriNetUnfolderBase]: 6245/12357 cut-off events. [2023-08-25 22:18:10,086 INFO L125 PetriNetUnfolderBase]: For 5151/5471 co-relation queries the response was YES. [2023-08-25 22:18:10,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26201 conditions, 12357 events. 6245/12357 cut-off events. For 5151/5471 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 105997 event pairs, 2381 based on Foata normal form. 1602/13503 useless extension candidates. Maximal degree in co-relation 26191. Up to 7102 conditions per place. [2023-08-25 22:18:10,129 INFO L140 encePairwiseOnDemand]: 383/395 looper letters, 51 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2023-08-25 22:18:10,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 481 flow [2023-08-25 22:18:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2023-08-25 22:18:10,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037974683544304 [2023-08-25 22:18:10,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2023-08-25 22:18:10,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2023-08-25 22:18:10,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:10,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2023-08-25 22:18:10,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:10,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:10,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:10,137 INFO L175 Difference]: Start difference. First operand has 120 places, 173 transitions, 859 flow. Second operand 3 states and 597 transitions. [2023-08-25 22:18:10,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 481 flow [2023-08-25 22:18:10,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 116 transitions, 413 flow, removed 28 selfloop flow, removed 6 redundant places. [2023-08-25 22:18:10,143 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 273 flow [2023-08-25 22:18:10,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2023-08-25 22:18:10,143 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -31 predicate places. [2023-08-25 22:18:10,143 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 273 flow [2023-08-25 22:18:10,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:10,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:10,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:10,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-25 22:18:10,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:10,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1537988818, now seen corresponding path program 1 times [2023-08-25 22:18:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453753715] [2023-08-25 22:18:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:10,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453753715] [2023-08-25 22:18:10,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453753715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:10,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:10,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:10,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599127571] [2023-08-25 22:18:10,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:10,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:10,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:10,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:10,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 395 [2023-08-25 22:18:10,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:10,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:10,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 395 [2023-08-25 22:18:10,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:12,664 INFO L124 PetriNetUnfolderBase]: 34535/53625 cut-off events. [2023-08-25 22:18:12,665 INFO L125 PetriNetUnfolderBase]: For 7496/7876 co-relation queries the response was YES. [2023-08-25 22:18:12,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115573 conditions, 53625 events. 34535/53625 cut-off events. For 7496/7876 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 446067 event pairs, 14287 based on Foata normal form. 0/46727 useless extension candidates. Maximal degree in co-relation 115565. Up to 28978 conditions per place. [2023-08-25 22:18:12,959 INFO L140 encePairwiseOnDemand]: 380/395 looper letters, 119 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2023-08-25 22:18:12,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 165 transitions, 711 flow [2023-08-25 22:18:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-08-25 22:18:12,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928270042194093 [2023-08-25 22:18:12,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-08-25 22:18:12,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-08-25 22:18:12,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:12,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-08-25 22:18:12,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:12,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:12,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:12,963 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 273 flow. Second operand 3 states and 584 transitions. [2023-08-25 22:18:12,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 165 transitions, 711 flow [2023-08-25 22:18:12,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 165 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:12,992 INFO L231 Difference]: Finished difference. Result has 111 places, 114 transitions, 363 flow [2023-08-25 22:18:12,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=111, PETRI_TRANSITIONS=114} [2023-08-25 22:18:12,993 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -28 predicate places. [2023-08-25 22:18:12,993 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 114 transitions, 363 flow [2023-08-25 22:18:12,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:12,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:12,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:12,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-25 22:18:12,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:12,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1537961385, now seen corresponding path program 1 times [2023-08-25 22:18:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:12,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145534532] [2023-08-25 22:18:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:13,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145534532] [2023-08-25 22:18:13,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145534532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:13,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:13,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966301709] [2023-08-25 22:18:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:13,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:13,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:13,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 395 [2023-08-25 22:18:13,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:13,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:13,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 395 [2023-08-25 22:18:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:15,965 INFO L124 PetriNetUnfolderBase]: 34735/54301 cut-off events. [2023-08-25 22:18:15,965 INFO L125 PetriNetUnfolderBase]: For 22465/23227 co-relation queries the response was YES. [2023-08-25 22:18:16,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133746 conditions, 54301 events. 34735/54301 cut-off events. For 22465/23227 co-relation queries the response was YES. Maximal size of possible extension queue 2487. Compared 449003 event pairs, 27631 based on Foata normal form. 0/49175 useless extension candidates. Maximal degree in co-relation 133736. Up to 51156 conditions per place. [2023-08-25 22:18:16,299 INFO L140 encePairwiseOnDemand]: 388/395 looper letters, 95 selfloop transitions, 11 changer transitions 0/140 dead transitions. [2023-08-25 22:18:16,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 140 transitions, 677 flow [2023-08-25 22:18:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-08-25 22:18:16,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472573839662447 [2023-08-25 22:18:16,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-08-25 22:18:16,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-08-25 22:18:16,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:16,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-08-25 22:18:16,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:16,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:16,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:16,303 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 363 flow. Second operand 3 states and 530 transitions. [2023-08-25 22:18:16,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 140 transitions, 677 flow [2023-08-25 22:18:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 140 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:16,353 INFO L231 Difference]: Finished difference. Result has 112 places, 123 transitions, 426 flow [2023-08-25 22:18:16,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=112, PETRI_TRANSITIONS=123} [2023-08-25 22:18:16,353 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -27 predicate places. [2023-08-25 22:18:16,353 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 123 transitions, 426 flow [2023-08-25 22:18:16,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:16,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:16,354 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:16,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-25 22:18:16,354 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:16,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1162234113, now seen corresponding path program 1 times [2023-08-25 22:18:16,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:16,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944966398] [2023-08-25 22:18:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-25 22:18:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944966398] [2023-08-25 22:18:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944966398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344638095] [2023-08-25 22:18:16,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:16,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:16,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:16,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 395 [2023-08-25 22:18:16,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 123 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:16,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:16,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 395 [2023-08-25 22:18:16,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:18,383 INFO L124 PetriNetUnfolderBase]: 18497/32882 cut-off events. [2023-08-25 22:18:18,383 INFO L125 PetriNetUnfolderBase]: For 10591/11041 co-relation queries the response was YES. [2023-08-25 22:18:18,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76441 conditions, 32882 events. 18497/32882 cut-off events. For 10591/11041 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 301154 event pairs, 14511 based on Foata normal form. 4/29925 useless extension candidates. Maximal degree in co-relation 76430. Up to 27362 conditions per place. [2023-08-25 22:18:18,586 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 83 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2023-08-25 22:18:18,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 132 transitions, 626 flow [2023-08-25 22:18:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-25 22:18:18,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092827004219409 [2023-08-25 22:18:18,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-25 22:18:18,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-25 22:18:18,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:18,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-25 22:18:18,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:18,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:18,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:18,590 INFO L175 Difference]: Start difference. First operand has 112 places, 123 transitions, 426 flow. Second operand 3 states and 485 transitions. [2023-08-25 22:18:18,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 132 transitions, 626 flow [2023-08-25 22:18:18,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:18,603 INFO L231 Difference]: Finished difference. Result has 112 places, 122 transitions, 417 flow [2023-08-25 22:18:18,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=112, PETRI_TRANSITIONS=122} [2023-08-25 22:18:18,603 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -27 predicate places. [2023-08-25 22:18:18,603 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 122 transitions, 417 flow [2023-08-25 22:18:18,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:18,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:18,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:18,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-25 22:18:18,604 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:18,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1297524669, now seen corresponding path program 1 times [2023-08-25 22:18:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:18,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355863932] [2023-08-25 22:18:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:18,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355863932] [2023-08-25 22:18:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355863932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960141804] [2023-08-25 22:18:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:18,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:18,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:18,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 395 [2023-08-25 22:18:18,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 122 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:18,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:18,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 395 [2023-08-25 22:18:18,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:20,579 INFO L124 PetriNetUnfolderBase]: 18016/32055 cut-off events. [2023-08-25 22:18:20,579 INFO L125 PetriNetUnfolderBase]: For 10223/10665 co-relation queries the response was YES. [2023-08-25 22:18:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74511 conditions, 32055 events. 18016/32055 cut-off events. For 10223/10665 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 292105 event pairs, 14153 based on Foata normal form. 6/29426 useless extension candidates. Maximal degree in co-relation 74500. Up to 26600 conditions per place. [2023-08-25 22:18:20,773 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 85 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2023-08-25 22:18:20,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 641 flow [2023-08-25 22:18:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-08-25 22:18:20,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4109704641350211 [2023-08-25 22:18:20,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-08-25 22:18:20,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-08-25 22:18:20,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:20,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-08-25 22:18:20,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:20,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:20,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:20,777 INFO L175 Difference]: Start difference. First operand has 112 places, 122 transitions, 417 flow. Second operand 3 states and 487 transitions. [2023-08-25 22:18:20,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 641 flow [2023-08-25 22:18:20,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:20,789 INFO L231 Difference]: Finished difference. Result has 111 places, 121 transitions, 415 flow [2023-08-25 22:18:20,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=111, PETRI_TRANSITIONS=121} [2023-08-25 22:18:20,790 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -28 predicate places. [2023-08-25 22:18:20,790 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 121 transitions, 415 flow [2023-08-25 22:18:20,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:20,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:20,790 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:20,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-25 22:18:20,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:20,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1335720009, now seen corresponding path program 1 times [2023-08-25 22:18:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:20,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671686110] [2023-08-25 22:18:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:20,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671686110] [2023-08-25 22:18:20,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671686110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474628733] [2023-08-25 22:18:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:20,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:20,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:20,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 395 [2023-08-25 22:18:20,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 121 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:20,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:20,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 395 [2023-08-25 22:18:20,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:25,571 INFO L124 PetriNetUnfolderBase]: 35466/55198 cut-off events. [2023-08-25 22:18:25,571 INFO L125 PetriNetUnfolderBase]: For 20062/20974 co-relation queries the response was YES. [2023-08-25 22:18:25,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136218 conditions, 55198 events. 35466/55198 cut-off events. For 20062/20974 co-relation queries the response was YES. Maximal size of possible extension queue 2577. Compared 455519 event pairs, 27174 based on Foata normal form. 0/48420 useless extension candidates. Maximal degree in co-relation 136207. Up to 50934 conditions per place. [2023-08-25 22:18:25,839 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 103 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2023-08-25 22:18:25,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 738 flow [2023-08-25 22:18:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-08-25 22:18:25,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4472573839662447 [2023-08-25 22:18:25,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-08-25 22:18:25,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-08-25 22:18:25,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:25,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-08-25 22:18:25,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:25,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:25,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:25,843 INFO L175 Difference]: Start difference. First operand has 111 places, 121 transitions, 415 flow. Second operand 3 states and 530 transitions. [2023-08-25 22:18:25,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 738 flow [2023-08-25 22:18:25,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 147 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:25,864 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 525 flow [2023-08-25 22:18:25,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2023-08-25 22:18:25,864 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -26 predicate places. [2023-08-25 22:18:25,864 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 131 transitions, 525 flow [2023-08-25 22:18:25,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:25,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:25,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:25,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-25 22:18:25,865 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:25,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2140302599, now seen corresponding path program 1 times [2023-08-25 22:18:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875263091] [2023-08-25 22:18:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:25,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875263091] [2023-08-25 22:18:25,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875263091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:25,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:25,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515837269] [2023-08-25 22:18:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:25,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:25,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 395 [2023-08-25 22:18:25,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 131 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:25,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:25,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 395 [2023-08-25 22:18:25,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:29,748 INFO L124 PetriNetUnfolderBase]: 38135/59285 cut-off events. [2023-08-25 22:18:29,748 INFO L125 PetriNetUnfolderBase]: For 32578/33570 co-relation queries the response was YES. [2023-08-25 22:18:29,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153095 conditions, 59285 events. 38135/59285 cut-off events. For 32578/33570 co-relation queries the response was YES. Maximal size of possible extension queue 2781. Compared 496085 event pairs, 25332 based on Foata normal form. 10/52777 useless extension candidates. Maximal degree in co-relation 153083. Up to 49043 conditions per place. [2023-08-25 22:18:30,061 INFO L140 encePairwiseOnDemand]: 385/395 looper letters, 139 selfloop transitions, 21 changer transitions 0/192 dead transitions. [2023-08-25 22:18:30,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 192 transitions, 1104 flow [2023-08-25 22:18:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2023-08-25 22:18:30,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708860759493671 [2023-08-25 22:18:30,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2023-08-25 22:18:30,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2023-08-25 22:18:30,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:30,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2023-08-25 22:18:30,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,065 INFO L175 Difference]: Start difference. First operand has 113 places, 131 transitions, 525 flow. Second operand 3 states and 558 transitions. [2023-08-25 22:18:30,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 192 transitions, 1104 flow [2023-08-25 22:18:30,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 192 transitions, 1052 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:30,172 INFO L231 Difference]: Finished difference. Result has 115 places, 148 transitions, 712 flow [2023-08-25 22:18:30,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=115, PETRI_TRANSITIONS=148} [2023-08-25 22:18:30,173 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -24 predicate places. [2023-08-25 22:18:30,173 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 148 transitions, 712 flow [2023-08-25 22:18:30,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:30,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:30,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-25 22:18:30,173 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:30,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1568553546, now seen corresponding path program 1 times [2023-08-25 22:18:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:30,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575678322] [2023-08-25 22:18:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575678322] [2023-08-25 22:18:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575678322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:30,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:30,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 22:18:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059608128] [2023-08-25 22:18:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:30,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 22:18:30,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:30,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 22:18:30,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 22:18:30,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 395 [2023-08-25 22:18:30,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 148 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:30,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:30,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 395 [2023-08-25 22:18:30,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:31,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 6#L706-1true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 233#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:31,645 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:31,645 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-25 22:18:31,645 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-25 22:18:31,645 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-25 22:18:31,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 100#L706-3true, Black: 235#(= |#race~count~0| 0), 5#L2-4true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 184#L2-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:31,726 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,727 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,727 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,727 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:31,776 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,776 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,776 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,776 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 16#L708-7true, 6#L706-1true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 233#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true]) [2023-08-25 22:18:31,777 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 6#L706-1true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 233#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 184#L2-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:31,777 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,777 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:31,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [130#L708-10true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), 5#L2-4true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 184#L2-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:31,866 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,866 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,866 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,866 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 100#L706-3true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 135#L708-5true, 280#true, 230#true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:31,867 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1514] L708-5-->L708-7: Formula: (= |v_#race~COND~0_248| |v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|) InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|, #race~COND~0=|v_#race~COND~0_248|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1, #race~COND~0][166], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 100#L706-3true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 12#L708-3true, 230#true, Black: 280#true, 178#L708-7true]) [2023-08-25 22:18:31,867 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,867 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,868 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:31,920 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:31,921 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 184#L2-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:31,921 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:31,921 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:32,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 6#L706-1true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 233#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 176#L717-4true, 184#L2-4true]) [2023-08-25 22:18:32,148 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,149 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,149 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,149 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), 5#L2-4true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 48#thr1Err15ASSERT_VIOLATIONASSERTtrue, 184#L2-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,172 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [130#L708-10true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 135#L708-5true, 280#true, 230#true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,172 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,172 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1514] L708-5-->L708-7: Formula: (= |v_#race~COND~0_248| |v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|) InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|, #race~COND~0=|v_#race~COND~0_248|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1, #race~COND~0][166], [130#L708-10true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 12#L708-3true, 230#true, Black: 280#true, 178#L708-7true]) [2023-08-25 22:18:32,173 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,173 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,173 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,173 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,221 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,221 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, 62#L708-10true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,221 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,221 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:32,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 100#L706-3true, Black: 235#(= |#race~count~0| 0), 5#L2-4true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 176#L717-4true, 184#L2-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,241 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,241 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,241 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,241 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, 176#L717-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:32,291 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,291 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,291 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,291 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 6#L706-1true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 233#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,292 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 6#L706-1true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 233#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 176#L717-4true, 184#L2-4true]) [2023-08-25 22:18:32,292 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,292 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 135#L708-5true, 280#true, 48#thr1Err15ASSERT_VIOLATIONASSERTtrue, 230#true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,315 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1514] L708-5-->L708-7: Formula: (= |v_#race~COND~0_248| |v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|) InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|, #race~COND~0=|v_#race~COND~0_248|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1, #race~COND~0][166], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 12#L708-3true, 48#thr1Err15ASSERT_VIOLATIONASSERTtrue, 230#true, Black: 280#true, 178#L708-7true]) [2023-08-25 22:18:32,315 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,315 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 257#(= |#race~COND~0| 0), thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 251#true, 16#L708-7true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,358 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,358 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,358 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,359 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:32,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 130#L708-10true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), 5#L2-4true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 184#L2-4true, 176#L717-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,379 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 100#L706-3true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 135#L708-5true, 280#true, 176#L717-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,379 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,379 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1514] L708-5-->L708-7: Formula: (= |v_#race~COND~0_248| |v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|) InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|, #race~COND~0=|v_#race~COND~0_248|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1, #race~COND~0][166], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 100#L706-3true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 12#L708-3true, 176#L717-4true, 230#true, Black: 280#true, 178#L708-7true]) [2023-08-25 22:18:32,380 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,380 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,380 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,380 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 230#true, 176#L717-4true]) [2023-08-25 22:18:32,430 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:32,430 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,430 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, 176#L717-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:32,431 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,431 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,431 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,431 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:32,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), 5#L2-4true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, 48#thr1Err15ASSERT_VIOLATIONASSERTtrue, 176#L717-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,511 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,511 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,511 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,511 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 130#L708-10true, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 135#L708-5true, 280#true, 176#L717-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,512 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1514] L708-5-->L708-7: Formula: (= |v_#race~COND~0_248| |v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|) InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|, #race~COND~0=|v_#race~COND~0_248|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1, #race~COND~0][166], [130#L708-10true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 12#L708-3true, 176#L717-4true, 230#true, Black: 280#true, 178#L708-7true]) [2023-08-25 22:18:32,512 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,512 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 230#true, 176#L717-4true]) [2023-08-25 22:18:32,563 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,563 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,563 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,563 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:32,564 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, 62#L708-10true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, 176#L717-4true]) [2023-08-25 22:18:32,564 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,564 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 135#L708-5true, 280#true, 48#thr1Err15ASSERT_VIOLATIONASSERTtrue, 176#L717-4true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:32,630 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1514] L708-5-->L708-7: Formula: (= |v_#race~COND~0_248| |v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|) InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1_21|, #race~COND~0=|v_#race~COND~0_248|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1, #race~COND~0][166], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 12#L708-3true, 48#thr1Err15ASSERT_VIOLATIONASSERTtrue, 176#L717-4true, 230#true, Black: 280#true, 178#L708-7true]) [2023-08-25 22:18:32,630 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,630 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][169], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 16#L708-7true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 280#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 176#L717-4true]) [2023-08-25 22:18:32,675 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][171], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 280#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, 176#L717-4true]) [2023-08-25 22:18:32,675 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:32,675 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:33,164 INFO L124 PetriNetUnfolderBase]: 22798/41197 cut-off events. [2023-08-25 22:18:33,164 INFO L125 PetriNetUnfolderBase]: For 47504/49694 co-relation queries the response was YES. [2023-08-25 22:18:33,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110630 conditions, 41197 events. 22798/41197 cut-off events. For 47504/49694 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 396249 event pairs, 7943 based on Foata normal form. 222/38451 useless extension candidates. Maximal degree in co-relation 110617. Up to 22364 conditions per place. [2023-08-25 22:18:33,358 INFO L140 encePairwiseOnDemand]: 385/395 looper letters, 173 selfloop transitions, 12 changer transitions 0/248 dead transitions. [2023-08-25 22:18:33,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 248 transitions, 1567 flow [2023-08-25 22:18:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:18:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:18:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2023-08-25 22:18:33,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46244725738396625 [2023-08-25 22:18:33,360 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1096 transitions. [2023-08-25 22:18:33,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1096 transitions. [2023-08-25 22:18:33,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:33,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1096 transitions. [2023-08-25 22:18:33,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,363 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,363 INFO L175 Difference]: Start difference. First operand has 115 places, 148 transitions, 712 flow. Second operand 6 states and 1096 transitions. [2023-08-25 22:18:33,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 248 transitions, 1567 flow [2023-08-25 22:18:33,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 248 transitions, 1465 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:33,749 INFO L231 Difference]: Finished difference. Result has 122 places, 155 transitions, 719 flow [2023-08-25 22:18:33,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=122, PETRI_TRANSITIONS=155} [2023-08-25 22:18:33,750 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -17 predicate places. [2023-08-25 22:18:33,750 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 155 transitions, 719 flow [2023-08-25 22:18:33,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:33,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-25 22:18:33,750 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:33,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 458585671, now seen corresponding path program 1 times [2023-08-25 22:18:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717764197] [2023-08-25 22:18:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:18:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717764197] [2023-08-25 22:18:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717764197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:18:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236840301] [2023-08-25 22:18:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:33,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:18:33,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:33,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:18:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 22:18:33,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 395 [2023-08-25 22:18:33,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 155 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:33,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:33,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 395 [2023-08-25 22:18:33,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:35,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][142], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:35,029 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:35,029 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:35,029 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:35,029 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:35,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][142], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true]) [2023-08-25 22:18:35,179 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:35,179 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:35,179 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:35,179 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:35,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:35,328 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,328 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,329 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,329 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][80], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 133#L708-5true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:35,330 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,330 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,330 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,330 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is not cut-off event [2023-08-25 22:18:35,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][142], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 300#true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true]) [2023-08-25 22:18:35,336 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:35,336 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:35,336 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:35,336 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:35,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][142], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, 184#L2-4true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:35,565 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:35,565 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:35,565 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:35,565 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:35,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:35,627 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,627 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,627 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,627 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][80], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, 133#L708-5true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:35,629 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,629 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,629 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,629 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is not cut-off event [2023-08-25 22:18:35,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][142], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 184#L2-4true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:35,713 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:35,713 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:35,713 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:35,713 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:35,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 16#L708-7true, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:35,769 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,770 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,770 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,770 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][80], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, 154#L717-5true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:35,771 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,771 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,771 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,771 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is not cut-off event [2023-08-25 22:18:35,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:35,843 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,843 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,843 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,843 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][80], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, 176#L717-4true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|)]) [2023-08-25 22:18:35,844 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,844 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,844 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,844 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is not cut-off event [2023-08-25 22:18:35,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][142], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:35,849 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:35,849 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:35,849 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:35,849 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:35,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 176#L717-4true]) [2023-08-25 22:18:35,960 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,960 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,960 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,960 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][80], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 133#L708-5true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 184#L2-4true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:35,962 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,962 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,962 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is not cut-off event [2023-08-25 22:18:35,962 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is not cut-off event [2023-08-25 22:18:36,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][70], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 16#L708-7true, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 12#L708-3true, 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|)]) [2023-08-25 22:18:36,063 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,063 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,063 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,063 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][80], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 230#true, 176#L717-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true]) [2023-08-25 22:18:36,065 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,065 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,065 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,065 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is not cut-off event [2023-08-25 22:18:36,271 INFO L124 PetriNetUnfolderBase]: 18428/35630 cut-off events. [2023-08-25 22:18:36,271 INFO L125 PetriNetUnfolderBase]: For 32701/34530 co-relation queries the response was YES. [2023-08-25 22:18:36,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93252 conditions, 35630 events. 18428/35630 cut-off events. For 32701/34530 co-relation queries the response was YES. Maximal size of possible extension queue 2167. Compared 363680 event pairs, 6517 based on Foata normal form. 1261/34429 useless extension candidates. Maximal degree in co-relation 93235. Up to 16421 conditions per place. [2023-08-25 22:18:36,621 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 209 selfloop transitions, 12 changer transitions 0/297 dead transitions. [2023-08-25 22:18:36,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 297 transitions, 1767 flow [2023-08-25 22:18:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 22:18:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 22:18:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 998 transitions. [2023-08-25 22:18:36,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053164556962025 [2023-08-25 22:18:36,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 998 transitions. [2023-08-25 22:18:36,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 998 transitions. [2023-08-25 22:18:36,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:36,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 998 transitions. [2023-08-25 22:18:36,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.6) internal successors, (998), 5 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:36,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 395.0) internal successors, (2370), 6 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:36,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 395.0) internal successors, (2370), 6 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:36,625 INFO L175 Difference]: Start difference. First operand has 122 places, 155 transitions, 719 flow. Second operand 5 states and 998 transitions. [2023-08-25 22:18:36,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 297 transitions, 1767 flow [2023-08-25 22:18:36,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 297 transitions, 1767 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:18:36,719 INFO L231 Difference]: Finished difference. Result has 130 places, 164 transitions, 801 flow [2023-08-25 22:18:36,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=801, PETRI_PLACES=130, PETRI_TRANSITIONS=164} [2023-08-25 22:18:36,719 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -9 predicate places. [2023-08-25 22:18:36,719 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 164 transitions, 801 flow [2023-08-25 22:18:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:36,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:36,720 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:36,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-25 22:18:36,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:36,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash -435676085, now seen corresponding path program 1 times [2023-08-25 22:18:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610046815] [2023-08-25 22:18:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:36,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610046815] [2023-08-25 22:18:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610046815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:36,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443396040] [2023-08-25 22:18:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:36,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:36,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:36,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:36,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 395 [2023-08-25 22:18:36,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 164 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:36,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:36,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 395 [2023-08-25 22:18:36,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:39,899 INFO L124 PetriNetUnfolderBase]: 21205/39442 cut-off events. [2023-08-25 22:18:39,899 INFO L125 PetriNetUnfolderBase]: For 47553/49486 co-relation queries the response was YES. [2023-08-25 22:18:39,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113498 conditions, 39442 events. 21205/39442 cut-off events. For 47553/49486 co-relation queries the response was YES. Maximal size of possible extension queue 2218. Compared 394642 event pairs, 14897 based on Foata normal form. 245/36792 useless extension candidates. Maximal degree in co-relation 113477. Up to 31927 conditions per place. [2023-08-25 22:18:40,106 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 112 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2023-08-25 22:18:40,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 180 transitions, 1134 flow [2023-08-25 22:18:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-25 22:18:40,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084388185654008 [2023-08-25 22:18:40,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-25 22:18:40,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-25 22:18:40,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:40,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-25 22:18:40,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:40,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:40,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:40,113 INFO L175 Difference]: Start difference. First operand has 130 places, 164 transitions, 801 flow. Second operand 3 states and 484 transitions. [2023-08-25 22:18:40,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 180 transitions, 1134 flow [2023-08-25 22:18:40,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 180 transitions, 1134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:18:40,253 INFO L231 Difference]: Finished difference. Result has 131 places, 163 transitions, 803 flow [2023-08-25 22:18:40,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=131, PETRI_TRANSITIONS=163} [2023-08-25 22:18:40,253 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -8 predicate places. [2023-08-25 22:18:40,253 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 163 transitions, 803 flow [2023-08-25 22:18:40,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:40,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:40,253 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-25 22:18:40,254 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:40,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1865275569, now seen corresponding path program 1 times [2023-08-25 22:18:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:40,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388048205] [2023-08-25 22:18:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-25 22:18:40,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388048205] [2023-08-25 22:18:40,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388048205] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:40,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:40,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764030709] [2023-08-25 22:18:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:40,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:40,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 395 [2023-08-25 22:18:40,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 163 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:40,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:40,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 395 [2023-08-25 22:18:40,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:44,894 INFO L124 PetriNetUnfolderBase]: 39203/63345 cut-off events. [2023-08-25 22:18:44,894 INFO L125 PetriNetUnfolderBase]: For 68004/69375 co-relation queries the response was YES. [2023-08-25 22:18:45,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186396 conditions, 63345 events. 39203/63345 cut-off events. For 68004/69375 co-relation queries the response was YES. Maximal size of possible extension queue 3651. Compared 571107 event pairs, 27807 based on Foata normal form. 19/55882 useless extension candidates. Maximal degree in co-relation 186374. Up to 57776 conditions per place. [2023-08-25 22:18:45,472 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 140 selfloop transitions, 17 changer transitions 0/196 dead transitions. [2023-08-25 22:18:45,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 196 transitions, 1288 flow [2023-08-25 22:18:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2023-08-25 22:18:45,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44641350210970465 [2023-08-25 22:18:45,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2023-08-25 22:18:45,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2023-08-25 22:18:45,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:45,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2023-08-25 22:18:45,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:45,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:45,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:45,475 INFO L175 Difference]: Start difference. First operand has 131 places, 163 transitions, 803 flow. Second operand 3 states and 529 transitions. [2023-08-25 22:18:45,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 196 transitions, 1288 flow [2023-08-25 22:18:45,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 196 transitions, 1284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:45,856 INFO L231 Difference]: Finished difference. Result has 133 places, 176 transitions, 980 flow [2023-08-25 22:18:45,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=980, PETRI_PLACES=133, PETRI_TRANSITIONS=176} [2023-08-25 22:18:45,857 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, -6 predicate places. [2023-08-25 22:18:45,857 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 176 transitions, 980 flow [2023-08-25 22:18:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:45,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:45,857 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:45,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-08-25 22:18:45,857 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:45,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash -621052889, now seen corresponding path program 1 times [2023-08-25 22:18:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531314698] [2023-08-25 22:18:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531314698] [2023-08-25 22:18:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531314698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 22:18:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862284721] [2023-08-25 22:18:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:45,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 22:18:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:45,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 22:18:45,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 22:18:45,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 395 [2023-08-25 22:18:45,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 176 transitions, 980 flow. Second operand has 5 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:45,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:45,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 395 [2023-08-25 22:18:45,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:47,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 6#L706-1true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 233#true, Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,420 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-08-25 22:18:47,420 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-25 22:18:47,420 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-25 22:18:47,420 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-08-25 22:18:47,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,604 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,604 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,604 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,604 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 154#L717-5true, Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 302#(= ~COND~0 0), 6#L706-1true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 233#true, Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, 184#L2-4true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,604 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,604 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,604 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,605 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 154#L717-5true, Black: 257#(= |#race~COND~0| 0), thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 6#L706-1true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 233#true, Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, 12#L708-3true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,605 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,605 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,605 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,605 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2023-08-25 22:18:47,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 154#L717-5true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, 62#L708-10true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 230#true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,961 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,961 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 133#L708-5true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 230#true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,962 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:47,962 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:47,962 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-08-25 22:18:48,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 6#L706-1true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 233#true, Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,054 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,054 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,054 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,054 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [30#L3-6true, 154#L717-5true, Black: 255#true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 230#true, 184#L2-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,158 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,158 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,158 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,158 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, Black: 255#true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 230#true, 184#L2-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,159 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 154#L717-5true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 257#(= |#race~COND~0| 0), 302#(= ~COND~0 0), 16#L708-7true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 315#true, 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,159 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,159 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-08-25 22:18:48,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 176#L717-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,264 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,264 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,264 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,264 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), 6#L706-1true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 133#L708-5true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 233#true, Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,264 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,264 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,265 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,265 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 16#L708-7true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 6#L706-1true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 233#true, Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,265 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,265 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,265 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,265 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [154#L717-5true, Black: 255#true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 230#true, 184#L2-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,353 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,353 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,353 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,354 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [154#L717-5true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 257#(= |#race~COND~0| 0), 251#true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 16#L708-7true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 12#L708-3true, 230#true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,354 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,354 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,354 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,354 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-08-25 22:18:48,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, 30#L3-6true, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, 300#true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,457 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 133#L708-5true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 176#L717-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,457 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), 16#L708-7true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 176#L717-4true, 272#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet8#1| |#race~count~0|), Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,457 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,457 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-08-25 22:18:48,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [30#L3-6true, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 300#true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 302#(= ~COND~0 0), Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 230#true, 184#L2-4true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,643 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, thr1Thread3of3ForFork0InUse, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), 62#L708-10true, 133#L708-5true, Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 184#L2-4true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,643 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 323#(and (<= ~count~0 0) (<= 0 ~count~0)), thr1Thread3of3ForFork0InUse, Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 302#(= ~COND~0 0), 16#L708-7true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 62#L708-10true, Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, 12#L708-3true, 230#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,643 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,643 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,644 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,644 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1470] L708-3-->L2-4: Formula: (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23| (mod v_~COND~0_222 256)) InVars {~COND~0=v_~COND~0_222} OutVars{thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_27|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_23|, ~COND~0=v_~COND~0_222} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][178], [323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 255#true, 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), 133#L708-5true, Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 230#true, 184#L2-4true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,800 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1513] L708-5-->L708-7: Formula: (= |v_#race~COND~0_246| |v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|) InVars {} OutVars{#race~COND~0=|v_#race~COND~0_246|, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1_25|} AuxVars[] AssignedVars[#race~COND~0, thr1Thread2of3ForFork0_Barrier2_#t~nondet9#1][176], [323#(and (<= ~count~0 0) (<= 0 ~count~0)), Black: 257#(= |#race~COND~0| 0), 288#(and (<= ~count~0 0) (<= 0 ~count~0)), 251#true, 302#(= ~COND~0 0), Black: 263#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet7#1| |#race~COND~0|), Black: 276#(= |#race~COND~0| |thr1Thread2of3ForFork0_Barrier2_#t~nondet7#1|), 315#true, Black: 282#(= |thr1Thread1of3ForFork0_Barrier2_#t~nondet9#1| |#race~COND~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 29#thr1Err15ASSERT_VIOLATIONASSERTtrue, 16#L708-7true, Black: 292#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 294#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post5#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post5#1|)), Black: 290#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 235#(= |#race~count~0| 0), Black: 303#(= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|), Black: 300#true, Black: 305#(and (= ~COND~0 0) (= 0 |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1|)), 12#L708-3true, 230#true, 176#L717-4true, Black: 317#(= |#race~COND~0| |thr1Thread3of3ForFork0_Barrier2_#t~nondet7#1|)]) [2023-08-25 22:18:48,800 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:48,800 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-08-25 22:18:49,362 INFO L124 PetriNetUnfolderBase]: 22616/41632 cut-off events. [2023-08-25 22:18:49,362 INFO L125 PetriNetUnfolderBase]: For 70769/73311 co-relation queries the response was YES. [2023-08-25 22:18:49,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126942 conditions, 41632 events. 22616/41632 cut-off events. For 70769/73311 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 414787 event pairs, 7383 based on Foata normal form. 322/39370 useless extension candidates. Maximal degree in co-relation 126919. Up to 19031 conditions per place. [2023-08-25 22:18:49,609 INFO L140 encePairwiseOnDemand]: 385/395 looper letters, 196 selfloop transitions, 13 changer transitions 0/278 dead transitions. [2023-08-25 22:18:49,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 278 transitions, 1957 flow [2023-08-25 22:18:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 22:18:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 22:18:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1093 transitions. [2023-08-25 22:18:49,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4611814345991561 [2023-08-25 22:18:49,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1093 transitions. [2023-08-25 22:18:49,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1093 transitions. [2023-08-25 22:18:49,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:49,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1093 transitions. [2023-08-25 22:18:49,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:49,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:49,614 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 395.0) internal successors, (2765), 7 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:49,614 INFO L175 Difference]: Start difference. First operand has 133 places, 176 transitions, 980 flow. Second operand 6 states and 1093 transitions. [2023-08-25 22:18:49,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 278 transitions, 1957 flow [2023-08-25 22:18:49,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 278 transitions, 1907 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-25 22:18:49,944 INFO L231 Difference]: Finished difference. Result has 139 places, 180 transitions, 992 flow [2023-08-25 22:18:49,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=992, PETRI_PLACES=139, PETRI_TRANSITIONS=180} [2023-08-25 22:18:49,945 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 0 predicate places. [2023-08-25 22:18:49,945 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 180 transitions, 992 flow [2023-08-25 22:18:49,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 162.2) internal successors, (811), 5 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:49,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:49,945 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:18:49,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-08-25 22:18:49,945 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:49,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1014168868, now seen corresponding path program 1 times [2023-08-25 22:18:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184658424] [2023-08-25 22:18:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184658424] [2023-08-25 22:18:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184658424] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:49,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:18:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320428313] [2023-08-25 22:18:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:49,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:18:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:18:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:18:49,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 395 [2023-08-25 22:18:49,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 180 transitions, 992 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:49,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:49,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 395 [2023-08-25 22:18:49,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:55,250 INFO L124 PetriNetUnfolderBase]: 40174/65190 cut-off events. [2023-08-25 22:18:55,250 INFO L125 PetriNetUnfolderBase]: For 98678/100249 co-relation queries the response was YES. [2023-08-25 22:18:55,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199566 conditions, 65190 events. 40174/65190 cut-off events. For 98678/100249 co-relation queries the response was YES. Maximal size of possible extension queue 3686. Compared 593391 event pairs, 26822 based on Foata normal form. 37/58383 useless extension candidates. Maximal degree in co-relation 199540. Up to 58068 conditions per place. [2023-08-25 22:18:55,685 INFO L140 encePairwiseOnDemand]: 386/395 looper letters, 176 selfloop transitions, 27 changer transitions 0/244 dead transitions. [2023-08-25 22:18:55,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 244 transitions, 1742 flow [2023-08-25 22:18:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:18:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:18:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2023-08-25 22:18:55,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675105485232067 [2023-08-25 22:18:55,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2023-08-25 22:18:55,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2023-08-25 22:18:55,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:55,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2023-08-25 22:18:55,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:55,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:55,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:55,688 INFO L175 Difference]: Start difference. First operand has 139 places, 180 transitions, 992 flow. Second operand 3 states and 554 transitions. [2023-08-25 22:18:55,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 244 transitions, 1742 flow [2023-08-25 22:18:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 244 transitions, 1722 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-25 22:18:56,807 INFO L231 Difference]: Finished difference. Result has 141 places, 197 transitions, 1231 flow [2023-08-25 22:18:56,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=141, PETRI_TRANSITIONS=197} [2023-08-25 22:18:56,807 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2023-08-25 22:18:56,807 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 197 transitions, 1231 flow [2023-08-25 22:18:56,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:56,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:18:56,808 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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-08-25 22:18:56,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-08-25 22:18:56,808 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err15ASSERT_VIOLATIONASSERT === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err15ASSERT_VIOLATIONASSERT, thr1Err12ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2023-08-25 22:18:56,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:18:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -341218700, now seen corresponding path program 1 times [2023-08-25 22:18:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:18:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501440617] [2023-08-25 22:18:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:18:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:18:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:18:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 22:18:56,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:18:56,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501440617] [2023-08-25 22:18:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501440617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:18:56,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:18:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:18:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318602791] [2023-08-25 22:18:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:18:56,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:18:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:18:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:18:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 22:18:56,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 395 [2023-08-25 22:18:56,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 197 transitions, 1231 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:56,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:18:56,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 395 [2023-08-25 22:18:56,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:18:59,771 INFO L124 PetriNetUnfolderBase]: 16215/31375 cut-off events. [2023-08-25 22:18:59,772 INFO L125 PetriNetUnfolderBase]: For 72482/74977 co-relation queries the response was YES. [2023-08-25 22:18:59,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101263 conditions, 31375 events. 16215/31375 cut-off events. For 72482/74977 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 316465 event pairs, 5701 based on Foata normal form. 1207/30368 useless extension candidates. Maximal degree in co-relation 101236. Up to 15591 conditions per place. [2023-08-25 22:18:59,967 INFO L140 encePairwiseOnDemand]: 387/395 looper letters, 235 selfloop transitions, 17 changer transitions 0/338 dead transitions. [2023-08-25 22:18:59,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 338 transitions, 2506 flow [2023-08-25 22:18:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 22:18:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 22:18:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 978 transitions. [2023-08-25 22:18:59,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951898734177215 [2023-08-25 22:18:59,970 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 978 transitions. [2023-08-25 22:18:59,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 978 transitions. [2023-08-25 22:18:59,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:18:59,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 978 transitions. [2023-08-25 22:18:59,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.6) internal successors, (978), 5 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:59,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 395.0) internal successors, (2370), 6 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:59,996 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 395.0) internal successors, (2370), 6 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:18:59,997 INFO L175 Difference]: Start difference. First operand has 141 places, 197 transitions, 1231 flow. Second operand 5 states and 978 transitions. [2023-08-25 22:18:59,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 338 transitions, 2506 flow