/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:55:03,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:55:03,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:55:03,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:55:03,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:55:03,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:55:03,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:55:03,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:55:03,434 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:55:03,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:55:03,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:55:03,434 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:55:03,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:55:03,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:55:03,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:55:03,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:55:03,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:55:03,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:55:03,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:55:03,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:55:03,437 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:55:03,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:55:03,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:55:03,438 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:55:03,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:55:03,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:55:03,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:55:03,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:55:03,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:55:03,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:55:03,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:55:03,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:55:03,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:55:03,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 11:55:03,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:55:03,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:55:03,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:55:03,582 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:55:03,583 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:55:03,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-11-10 11:55:04,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:55:04,820 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:55:04,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-11-10 11:55:04,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a3847ad/0a02ea181ae546c0a539b218476ce10e/FLAG76a66c943 [2023-11-10 11:55:05,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a3847ad/0a02ea181ae546c0a539b218476ce10e [2023-11-10 11:55:05,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:55:05,168 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:55:05,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:55:05,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:55:05,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:55:05,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7ec547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05, skipping insertion in model container [2023-11-10 11:55:05,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,208 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:55:05,316 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2023-11-10 11:55:05,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:55:05,422 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:55:05,430 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2023-11-10 11:55:05,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:55:05,497 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:55:05,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05 WrapperNode [2023-11-10 11:55:05,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:55:05,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:55:05,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:55:05,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:55:05,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,559 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2023-11-10 11:55:05,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:55:05,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:55:05,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:55:05,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:55:05,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:55:05,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:55:05,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:55:05,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:55:05,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (1/1) ... [2023-11-10 11:55:05,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:55:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:55:05,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:55:05,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:55:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 11:55:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2023-11-10 11:55:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2023-11-10 11:55:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:55:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-10 11:55:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:55:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:55:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:55:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:55:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:55:05,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:55:05,691 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:55:05,787 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:55:05,789 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:55:05,980 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:55:05,989 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:55:05,989 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-10 11:55:05,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:05 BoogieIcfgContainer [2023-11-10 11:55:05,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:55:05,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:55:05,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:55:05,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:55:05,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:55:05" (1/3) ... [2023-11-10 11:55:06,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1215b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:05, skipping insertion in model container [2023-11-10 11:55:06,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:05" (2/3) ... [2023-11-10 11:55:06,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1215b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:06, skipping insertion in model container [2023-11-10 11:55:06,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:05" (3/3) ... [2023-11-10 11:55:06,001 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2023-11-10 11:55:06,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:55:06,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:55:06,012 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:55:06,083 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:55:06,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 284 flow [2023-11-10 11:55:06,169 INFO L124 PetriNetUnfolderBase]: 10/139 cut-off events. [2023-11-10 11:55:06,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:06,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 139 events. 10/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 248 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-10 11:55:06,176 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 140 transitions, 284 flow [2023-11-10 11:55:06,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 139 transitions, 281 flow [2023-11-10 11:55:06,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:55:06,193 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f7966f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:55:06,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:55:06,217 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:55:06,218 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-11-10 11:55:06,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:06,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:06,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:06,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:06,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 157040612, now seen corresponding path program 1 times [2023-11-10 11:55:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:06,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441279440] [2023-11-10 11:55:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441279440] [2023-11-10 11:55:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441279440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:55:06,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027701515] [2023-11-10 11:55:06,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:06,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-10 11:55:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-10 11:55:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-10 11:55:06,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 140 [2023-11-10 11:55:06,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 139 transitions, 281 flow. Second operand has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:06,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:06,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 140 [2023-11-10 11:55:06,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:06,601 INFO L124 PetriNetUnfolderBase]: 5/129 cut-off events. [2023-11-10 11:55:06,601 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-10 11:55:06,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 129 events. 5/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 198 event pairs, 0 based on Foata normal form. 5/128 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-10 11:55:06,605 INFO L140 encePairwiseOnDemand]: 134/140 looper letters, 1 selfloop transitions, 0 changer transitions 0/129 dead transitions. [2023-11-10 11:55:06,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 129 transitions, 263 flow [2023-11-10 11:55:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-10 11:55:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-10 11:55:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 269 transitions. [2023-11-10 11:55:06,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9607142857142857 [2023-11-10 11:55:06,615 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 269 transitions. [2023-11-10 11:55:06,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 269 transitions. [2023-11-10 11:55:06,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:06,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 269 transitions. [2023-11-10 11:55:06,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:06,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:06,624 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:06,625 INFO L175 Difference]: Start difference. First operand has 133 places, 139 transitions, 281 flow. Second operand 2 states and 269 transitions. [2023-11-10 11:55:06,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 129 transitions, 263 flow [2023-11-10 11:55:06,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 129 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 11:55:06,630 INFO L231 Difference]: Finished difference. Result has 128 places, 129 transitions, 260 flow [2023-11-10 11:55:06,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=128, PETRI_TRANSITIONS=129} [2023-11-10 11:55:06,634 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, -5 predicate places. [2023-11-10 11:55:06,634 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 129 transitions, 260 flow [2023-11-10 11:55:06,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:06,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:06,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:06,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:55:06,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:06,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1287014022, now seen corresponding path program 1 times [2023-11-10 11:55:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:06,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033468686] [2023-11-10 11:55:06,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:06,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:06,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033468686] [2023-11-10 11:55:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033468686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:06,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:55:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23626866] [2023-11-10 11:55:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:06,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:55:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:55:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:55:06,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 140 [2023-11-10 11:55:06,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 129 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:06,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:06,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 140 [2023-11-10 11:55:06,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:07,145 INFO L124 PetriNetUnfolderBase]: 191/1012 cut-off events. [2023-11-10 11:55:07,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:55:07,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1012 events. 191/1012 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6809 event pairs, 55 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1384. Up to 222 conditions per place. [2023-11-10 11:55:07,150 INFO L140 encePairwiseOnDemand]: 123/140 looper letters, 72 selfloop transitions, 27 changer transitions 0/183 dead transitions. [2023-11-10 11:55:07,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 183 transitions, 566 flow [2023-11-10 11:55:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-10 11:55:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-10 11:55:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1145 transitions. [2023-11-10 11:55:07,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6815476190476191 [2023-11-10 11:55:07,154 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1145 transitions. [2023-11-10 11:55:07,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1145 transitions. [2023-11-10 11:55:07,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:07,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1145 transitions. [2023-11-10 11:55:07,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 95.41666666666667) internal successors, (1145), 12 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:07,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:07,160 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 140.0) internal successors, (1820), 13 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:07,160 INFO L175 Difference]: Start difference. First operand has 128 places, 129 transitions, 260 flow. Second operand 12 states and 1145 transitions. [2023-11-10 11:55:07,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 183 transitions, 566 flow [2023-11-10 11:55:07,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 183 transitions, 566 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:07,163 INFO L231 Difference]: Finished difference. Result has 145 places, 156 transitions, 435 flow [2023-11-10 11:55:07,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=435, PETRI_PLACES=145, PETRI_TRANSITIONS=156} [2023-11-10 11:55:07,164 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 12 predicate places. [2023-11-10 11:55:07,164 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 156 transitions, 435 flow [2023-11-10 11:55:07,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:07,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:07,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:07,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:55:07,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:07,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash -260258681, now seen corresponding path program 1 times [2023-11-10 11:55:07,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:07,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47397735] [2023-11-10 11:55:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47397735] [2023-11-10 11:55:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47397735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:07,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:55:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966039485] [2023-11-10 11:55:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:55:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:55:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:55:07,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 140 [2023-11-10 11:55:07,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 156 transitions, 435 flow. Second operand has 15 states, 15 states have (on average 73.33333333333333) internal successors, (1100), 15 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:07,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:07,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 140 [2023-11-10 11:55:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:08,340 INFO L124 PetriNetUnfolderBase]: 745/2651 cut-off events. [2023-11-10 11:55:08,340 INFO L125 PetriNetUnfolderBase]: For 434/438 co-relation queries the response was YES. [2023-11-10 11:55:08,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 2651 events. 745/2651 cut-off events. For 434/438 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 21949 event pairs, 104 based on Foata normal form. 18/2518 useless extension candidates. Maximal degree in co-relation 4598. Up to 581 conditions per place. [2023-11-10 11:55:08,353 INFO L140 encePairwiseOnDemand]: 115/140 looper letters, 192 selfloop transitions, 84 changer transitions 0/349 dead transitions. [2023-11-10 11:55:08,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 349 transitions, 1568 flow [2023-11-10 11:55:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-10 11:55:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-10 11:55:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2296 transitions. [2023-11-10 11:55:08,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5655172413793104 [2023-11-10 11:55:08,358 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2296 transitions. [2023-11-10 11:55:08,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2296 transitions. [2023-11-10 11:55:08,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:08,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2296 transitions. [2023-11-10 11:55:08,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 79.17241379310344) internal successors, (2296), 29 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:08,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 140.0) internal successors, (4200), 30 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:08,369 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 140.0) internal successors, (4200), 30 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:08,369 INFO L175 Difference]: Start difference. First operand has 145 places, 156 transitions, 435 flow. Second operand 29 states and 2296 transitions. [2023-11-10 11:55:08,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 349 transitions, 1568 flow [2023-11-10 11:55:08,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 349 transitions, 1568 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:08,377 INFO L231 Difference]: Finished difference. Result has 186 places, 232 transitions, 1033 flow [2023-11-10 11:55:08,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1033, PETRI_PLACES=186, PETRI_TRANSITIONS=232} [2023-11-10 11:55:08,378 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 53 predicate places. [2023-11-10 11:55:08,378 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 232 transitions, 1033 flow [2023-11-10 11:55:08,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.33333333333333) internal successors, (1100), 15 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:08,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:08,378 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:55:08,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:08,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1142743201, now seen corresponding path program 1 times [2023-11-10 11:55:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193009804] [2023-11-10 11:55:08,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:08,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193009804] [2023-11-10 11:55:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193009804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:08,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:55:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840017188] [2023-11-10 11:55:08,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:08,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:55:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:08,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:55:08,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:55:08,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2023-11-10 11:55:08,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 232 transitions, 1033 flow. Second operand has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:08,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:08,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2023-11-10 11:55:08,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:12,383 INFO L124 PetriNetUnfolderBase]: 3496/8503 cut-off events. [2023-11-10 11:55:12,383 INFO L125 PetriNetUnfolderBase]: For 5686/5731 co-relation queries the response was YES. [2023-11-10 11:55:12,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20672 conditions, 8503 events. 3496/8503 cut-off events. For 5686/5731 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 69400 event pairs, 306 based on Foata normal form. 40/8213 useless extension candidates. Maximal degree in co-relation 20649. Up to 2201 conditions per place. [2023-11-10 11:55:12,428 INFO L140 encePairwiseOnDemand]: 109/140 looper letters, 568 selfloop transitions, 405 changer transitions 0/1054 dead transitions. [2023-11-10 11:55:12,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1054 transitions, 6658 flow [2023-11-10 11:55:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-10 11:55:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-11-10 11:55:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5994 transitions. [2023-11-10 11:55:12,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.548901098901099 [2023-11-10 11:55:12,444 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 5994 transitions. [2023-11-10 11:55:12,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 5994 transitions. [2023-11-10 11:55:12,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:12,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 5994 transitions. [2023-11-10 11:55:12,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 76.84615384615384) internal successors, (5994), 78 states have internal predecessors, (5994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 140.0) internal successors, (11060), 79 states have internal predecessors, (11060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,474 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 140.0) internal successors, (11060), 79 states have internal predecessors, (11060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,475 INFO L175 Difference]: Start difference. First operand has 186 places, 232 transitions, 1033 flow. Second operand 78 states and 5994 transitions. [2023-11-10 11:55:12,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1054 transitions, 6658 flow [2023-11-10 11:55:12,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1054 transitions, 6627 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-10 11:55:12,539 INFO L231 Difference]: Finished difference. Result has 292 places, 667 transitions, 4765 flow [2023-11-10 11:55:12,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=4765, PETRI_PLACES=292, PETRI_TRANSITIONS=667} [2023-11-10 11:55:12,541 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 159 predicate places. [2023-11-10 11:55:12,541 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 667 transitions, 4765 flow [2023-11-10 11:55:12,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:12,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:12,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:12,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:55:12,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:12,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -698192161, now seen corresponding path program 2 times [2023-11-10 11:55:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:12,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383947924] [2023-11-10 11:55:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383947924] [2023-11-10 11:55:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383947924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:55:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758753405] [2023-11-10 11:55:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:13,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:55:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:55:13,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:55:13,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2023-11-10 11:55:13,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 667 transitions, 4765 flow. Second operand has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:13,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:13,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2023-11-10 11:55:13,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:16,697 INFO L124 PetriNetUnfolderBase]: 4364/10774 cut-off events. [2023-11-10 11:55:16,698 INFO L125 PetriNetUnfolderBase]: For 26448/26638 co-relation queries the response was YES. [2023-11-10 11:55:16,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34838 conditions, 10774 events. 4364/10774 cut-off events. For 26448/26638 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 93159 event pairs, 338 based on Foata normal form. 89/10436 useless extension candidates. Maximal degree in co-relation 34782. Up to 3166 conditions per place. [2023-11-10 11:55:16,791 INFO L140 encePairwiseOnDemand]: 109/140 looper letters, 865 selfloop transitions, 475 changer transitions 0/1421 dead transitions. [2023-11-10 11:55:16,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1421 transitions, 11873 flow [2023-11-10 11:55:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-10 11:55:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-10 11:55:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4231 transitions. [2023-11-10 11:55:16,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5596560846560846 [2023-11-10 11:55:16,798 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4231 transitions. [2023-11-10 11:55:16,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4231 transitions. [2023-11-10 11:55:16,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:16,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4231 transitions. [2023-11-10 11:55:16,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 78.35185185185185) internal successors, (4231), 54 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:16,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 140.0) internal successors, (7700), 55 states have internal predecessors, (7700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:16,816 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 140.0) internal successors, (7700), 55 states have internal predecessors, (7700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:16,816 INFO L175 Difference]: Start difference. First operand has 292 places, 667 transitions, 4765 flow. Second operand 54 states and 4231 transitions. [2023-11-10 11:55:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 1421 transitions, 11873 flow [2023-11-10 11:55:17,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1421 transitions, 11625 flow, removed 124 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:17,093 INFO L231 Difference]: Finished difference. Result has 387 places, 926 transitions, 8392 flow [2023-11-10 11:55:17,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4521, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=8392, PETRI_PLACES=387, PETRI_TRANSITIONS=926} [2023-11-10 11:55:17,096 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 254 predicate places. [2023-11-10 11:55:17,096 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 926 transitions, 8392 flow [2023-11-10 11:55:17,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:17,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:17,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:17,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:55:17,097 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:17,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:17,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1499792301, now seen corresponding path program 3 times [2023-11-10 11:55:17,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:17,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111780269] [2023-11-10 11:55:17,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111780269] [2023-11-10 11:55:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111780269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:55:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719937414] [2023-11-10 11:55:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:55:17,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:55:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:55:17,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2023-11-10 11:55:17,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 926 transitions, 8392 flow. Second operand has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:17,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:17,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2023-11-10 11:55:17,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:23,385 INFO L124 PetriNetUnfolderBase]: 5347/12823 cut-off events. [2023-11-10 11:55:23,385 INFO L125 PetriNetUnfolderBase]: For 95574/95880 co-relation queries the response was YES. [2023-11-10 11:55:23,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56568 conditions, 12823 events. 5347/12823 cut-off events. For 95574/95880 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 111464 event pairs, 544 based on Foata normal form. 100/12397 useless extension candidates. Maximal degree in co-relation 56469. Up to 3860 conditions per place. [2023-11-10 11:55:23,509 INFO L140 encePairwiseOnDemand]: 111/140 looper letters, 949 selfloop transitions, 893 changer transitions 0/1923 dead transitions. [2023-11-10 11:55:23,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 1923 transitions, 21314 flow [2023-11-10 11:55:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-11-10 11:55:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-11-10 11:55:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 6294 transitions. [2023-11-10 11:55:23,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5482578397212543 [2023-11-10 11:55:23,516 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 6294 transitions. [2023-11-10 11:55:23,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 6294 transitions. [2023-11-10 11:55:23,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:23,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 6294 transitions. [2023-11-10 11:55:23,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 76.7560975609756) internal successors, (6294), 82 states have internal predecessors, (6294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:23,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 140.0) internal successors, (11620), 83 states have internal predecessors, (11620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:23,537 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 140.0) internal successors, (11620), 83 states have internal predecessors, (11620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:23,537 INFO L175 Difference]: Start difference. First operand has 387 places, 926 transitions, 8392 flow. Second operand 82 states and 6294 transitions. [2023-11-10 11:55:23,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 1923 transitions, 21314 flow [2023-11-10 11:55:23,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 1923 transitions, 20358 flow, removed 161 selfloop flow, removed 8 redundant places. [2023-11-10 11:55:24,091 INFO L231 Difference]: Finished difference. Result has 498 places, 1409 transitions, 16731 flow [2023-11-10 11:55:24,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=7777, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=16731, PETRI_PLACES=498, PETRI_TRANSITIONS=1409} [2023-11-10 11:55:24,092 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 365 predicate places. [2023-11-10 11:55:24,092 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 1409 transitions, 16731 flow [2023-11-10 11:55:24,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:24,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:24,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:24,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:55:24,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:24,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash 596946144, now seen corresponding path program 1 times [2023-11-10 11:55:24,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955917640] [2023-11-10 11:55:24,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:24,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955917640] [2023-11-10 11:55:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955917640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-10 11:55:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092828828] [2023-11-10 11:55:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:24,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-10 11:55:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:24,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-10 11:55:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-10 11:55:24,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 140 [2023-11-10 11:55:24,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1409 transitions, 16731 flow. Second operand has 18 states, 18 states have (on average 67.33333333333333) internal successors, (1212), 18 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:24,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:24,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 140 [2023-11-10 11:55:24,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:30,414 INFO L124 PetriNetUnfolderBase]: 4592/13416 cut-off events. [2023-11-10 11:55:30,414 INFO L125 PetriNetUnfolderBase]: For 117065/117320 co-relation queries the response was YES. [2023-11-10 11:55:30,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60440 conditions, 13416 events. 4592/13416 cut-off events. For 117065/117320 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 128527 event pairs, 520 based on Foata normal form. 165/13068 useless extension candidates. Maximal degree in co-relation 60304. Up to 4337 conditions per place. [2023-11-10 11:55:30,578 INFO L140 encePairwiseOnDemand]: 109/140 looper letters, 1154 selfloop transitions, 584 changer transitions 0/2024 dead transitions. [2023-11-10 11:55:30,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 2024 transitions, 26424 flow [2023-11-10 11:55:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-10 11:55:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-10 11:55:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3589 transitions. [2023-11-10 11:55:30,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.534077380952381 [2023-11-10 11:55:30,588 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3589 transitions. [2023-11-10 11:55:30,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3589 transitions. [2023-11-10 11:55:30,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:30,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3589 transitions. [2023-11-10 11:55:30,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 74.77083333333333) internal successors, (3589), 48 states have internal predecessors, (3589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:30,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 140.0) internal successors, (6860), 49 states have internal predecessors, (6860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:30,603 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 140.0) internal successors, (6860), 49 states have internal predecessors, (6860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:30,603 INFO L175 Difference]: Start difference. First operand has 498 places, 1409 transitions, 16731 flow. Second operand 48 states and 3589 transitions. [2023-11-10 11:55:30,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 2024 transitions, 26424 flow [2023-11-10 11:55:31,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 2024 transitions, 24396 flow, removed 1014 selfloop flow, removed 0 redundant places. [2023-11-10 11:55:31,717 INFO L231 Difference]: Finished difference. Result has 568 places, 1570 transitions, 18981 flow [2023-11-10 11:55:31,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=14779, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=423, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=18981, PETRI_PLACES=568, PETRI_TRANSITIONS=1570} [2023-11-10 11:55:31,718 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 435 predicate places. [2023-11-10 11:55:31,719 INFO L495 AbstractCegarLoop]: Abstraction has has 568 places, 1570 transitions, 18981 flow [2023-11-10 11:55:31,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 67.33333333333333) internal successors, (1212), 18 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:31,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:31,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:31,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:55:31,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:31,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 780064952, now seen corresponding path program 2 times [2023-11-10 11:55:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503323379] [2023-11-10 11:55:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503323379] [2023-11-10 11:55:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503323379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:31,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:55:31,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724060718] [2023-11-10 11:55:31,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:31,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:55:31,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:55:31,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:55:31,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 140 [2023-11-10 11:55:31,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 1570 transitions, 18981 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:31,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:31,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 140 [2023-11-10 11:55:31,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:34,671 INFO L124 PetriNetUnfolderBase]: 2656/8864 cut-off events. [2023-11-10 11:55:34,671 INFO L125 PetriNetUnfolderBase]: For 89473/89712 co-relation queries the response was YES. [2023-11-10 11:55:34,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44100 conditions, 8864 events. 2656/8864 cut-off events. For 89473/89712 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 83452 event pairs, 168 based on Foata normal form. 75/8592 useless extension candidates. Maximal degree in co-relation 43940. Up to 1321 conditions per place. [2023-11-10 11:55:34,770 INFO L140 encePairwiseOnDemand]: 127/140 looper letters, 503 selfloop transitions, 137 changer transitions 0/1371 dead transitions. [2023-11-10 11:55:34,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 1371 transitions, 17879 flow [2023-11-10 11:55:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-10 11:55:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-10 11:55:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 878 transitions. [2023-11-10 11:55:34,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7839285714285714 [2023-11-10 11:55:34,771 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 878 transitions. [2023-11-10 11:55:34,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 878 transitions. [2023-11-10 11:55:34,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:34,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 878 transitions. [2023-11-10 11:55:34,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:34,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 140.0) internal successors, (1260), 9 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:34,862 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 140.0) internal successors, (1260), 9 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:34,862 INFO L175 Difference]: Start difference. First operand has 568 places, 1570 transitions, 18981 flow. Second operand 8 states and 878 transitions. [2023-11-10 11:55:34,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 1371 transitions, 17879 flow [2023-11-10 11:55:35,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 1371 transitions, 16679 flow, removed 77 selfloop flow, removed 47 redundant places. [2023-11-10 11:55:35,526 INFO L231 Difference]: Finished difference. Result has 466 places, 1268 transitions, 14769 flow [2023-11-10 11:55:35,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=14220, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14769, PETRI_PLACES=466, PETRI_TRANSITIONS=1268} [2023-11-10 11:55:35,527 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 333 predicate places. [2023-11-10 11:55:35,527 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 1268 transitions, 14769 flow [2023-11-10 11:55:35,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:35,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:35,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:35,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:55:35,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:35,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1948565130, now seen corresponding path program 3 times [2023-11-10 11:55:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:35,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25833842] [2023-11-10 11:55:35,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:35,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25833842] [2023-11-10 11:55:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25833842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:55:35,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87827635] [2023-11-10 11:55:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:35,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:55:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:55:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:55:35,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 140 [2023-11-10 11:55:35,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1268 transitions, 14769 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:35,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 140 [2023-11-10 11:55:35,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:37,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([289] L714-5-->L717: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_ULTIMATE.start_pqueue_put_~qp#1.base_7| (store (select |v_#pthreadsMutex_6| |v_ULTIMATE.start_pqueue_put_~qp#1.base_7|) (+ |v_ULTIMATE.start_pqueue_put_~qp#1.offset_7| 4) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_7|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ULTIMATE.start_pqueue_put_~qp#1.offset=|v_ULTIMATE.start_pqueue_put_~qp#1.offset_7|, ULTIMATE.start_pqueue_put_~qp#1.base=|v_ULTIMATE.start_pqueue_put_~qp#1.base_7|} AuxVars[] AssignedVars[#pthreadsMutex][602], [620#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 662#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 690#(and (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 628#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 698#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 622#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 700#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 624#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 706#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 638#(and (or (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0) (and (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|))) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (or (< |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0))) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 615#(not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 668#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|)), Black: 696#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 642#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 604#true, Black: 752#(and (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 768#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 632#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 708#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 626#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 712#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 606#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|)), Black: 650#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 640#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 726#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (or (< |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0))) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 646#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 736#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), 92#L727-5true, Black: 758#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 674#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 770#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0)) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 684#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 732#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0)) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 694#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 644#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|)), Black: 750#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 636#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (or (< |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0))) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 728#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 710#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |~#pqb~0.base| |ULTIMATE.start_pqueue_put_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_~qp#1.offset| |~#pqb~0.offset|) (or (< (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) 0) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)))), Black: 486#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 560#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 470#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 492#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 494#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 530#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|)), Black: 498#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 488#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 534#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 480#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 472#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)), Black: 546#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 468#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 502#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 476#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 504#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|)), Black: 478#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 522#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|)), Black: 490#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 510#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 554#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 542#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 548#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 550#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 496#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem2#1|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#t~mem2#1| (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|))), Black: 536#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 516#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|)), Black: 466#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|)), Black: 474#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 556#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|)), Black: 500#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 506#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|)), Black: 538#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 558#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|)), Black: 482#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 544#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 552#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 528#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (not (= (+ |ULTIMATE.start_pqueue_put_#t~post4#1| 1) 0)) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 518#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 464#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|)) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 512#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|)) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), 460#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |~#pqb~0.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|)), workerThread1of1ForFork0InUse, Black: 847#(and (= |~#pqb~0.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 851#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 843#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 839#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 853#(and (= |~#pqb~0.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 871#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= 3 |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 849#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 861#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 855#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 897#(and (= |~#pqb~0.offset| 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), Black: 859#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 837#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 863#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 865#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 154#(and (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 867#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= 3 |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 143#(not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0)), Black: 887#(and (= |~#pqb~0.offset| 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0)), Black: 148#(and (or (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))) (not (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0))), Black: 881#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= 3 |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 142#(or (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|))), Black: 158#(and (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (not (= |workerThread1of1ForFork0_pqueue_get_#t~mem8#1| 0))), Black: 845#(and (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 891#(and (= |~#pqb~0.offset| 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 857#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= 3 |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 893#(and (= |~#pqb~0.offset| 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 875#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.offset| 0) (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= 3 |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| 3) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |#pthreadsMutex| 3) 4) 1) (= (select (select |#memory_int| 3) 0) 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= 3 |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (= 3 |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 285#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|)), Black: 267#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|)), 949#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 279#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_pqueue_put_~qp#1.base|) |ULTIMATE.start_pqueue_put_~qp#1.offset|) |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (<= |workerThread1of1ForFork0_pqueue_get_#t~mem6#1| |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (<= 1 |ULTIMATE.start_pqueue_put_#t~mem3#1|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|)), Black: 951#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= (select (select |#pthreadsMutex| |ULTIMATE.start_pqueue_put_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 953#(and (= |ULTIMATE.start_pqueue_put_~qp#1.offset| 0) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= (select (select |#pthreadsMutex| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) 4) 1) (= |ULTIMATE.start_pqueue_put_~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), 20#L717true, 137#true, 263#(and (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |~#pqb~0.offset|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base| |ULTIMATE.start_pqueue_put_~qp#1.base|) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| |ULTIMATE.start_pqueue_put_~qp#1.offset|)), 813#(and (= |~#pqb~0.offset| 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3)), 202#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3)), Black: 220#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 190#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0)), Black: 192#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0)), Black: 182#(and (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0)), Black: 194#(and (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0)), Black: 169#(and (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3)), Black: 198#(and (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0)), Black: 206#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))), 969#(and (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) (= |~#pqb~0.offset| 0) (= |ULTIMATE.start_pqueue_put_#in~qp#1.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |~#pqb~0.base| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) (= |ULTIMATE.start_pqueue_put_#in~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_~qp#1.offset| 0) (= |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset| 0)), Black: 184#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0)), Black: 228#(and (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))), Black: 204#(and (not (= 3 |ULTIMATE.start_main_~#tid~0#1.base|)) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))), 140#true, Black: 212#(and (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_#in~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_#in~qp#1.offset|) 0) (= (select |#valid| 3) 1) (= |~#pqb~0.base| 3) (= (select (select |#memory_int| |workerThread1of1ForFork0_pqueue_get_~qp#1.base|) |workerThread1of1ForFork0_pqueue_get_~qp#1.offset|) 0) (= (select (select |#memory_int| 3) |~#pqb~0.offset|) 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_~cond#1| 0)) (= |workerThread1of1ForFork0_pqueue_get_#t~mem7#1| 0) (not (= |workerThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0)))]) [2023-11-10 11:55:37,460 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-10 11:55:37,460 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:55:37,460 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:55:37,460 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:55:38,774 INFO L124 PetriNetUnfolderBase]: 3283/11349 cut-off events. [2023-11-10 11:55:38,774 INFO L125 PetriNetUnfolderBase]: For 107168/107432 co-relation queries the response was YES. [2023-11-10 11:55:38,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56126 conditions, 11349 events. 3283/11349 cut-off events. For 107168/107432 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 114479 event pairs, 359 based on Foata normal form. 87/10961 useless extension candidates. Maximal degree in co-relation 55993. Up to 1782 conditions per place. [2023-11-10 11:55:38,908 INFO L140 encePairwiseOnDemand]: 127/140 looper letters, 537 selfloop transitions, 153 changer transitions 0/1421 dead transitions. [2023-11-10 11:55:38,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 1421 transitions, 18234 flow [2023-11-10 11:55:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-10 11:55:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-10 11:55:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 876 transitions. [2023-11-10 11:55:38,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7821428571428571 [2023-11-10 11:55:38,910 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 876 transitions. [2023-11-10 11:55:38,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 876 transitions. [2023-11-10 11:55:38,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:38,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 876 transitions. [2023-11-10 11:55:38,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:38,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 140.0) internal successors, (1260), 9 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:38,913 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 140.0) internal successors, (1260), 9 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:38,913 INFO L175 Difference]: Start difference. First operand has 466 places, 1268 transitions, 14769 flow. Second operand 8 states and 876 transitions. [2023-11-10 11:55:38,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 1421 transitions, 18234 flow [2023-11-10 11:55:39,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1421 transitions, 17964 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-11-10 11:55:39,839 INFO L231 Difference]: Finished difference. Result has 473 places, 1298 transitions, 15440 flow [2023-11-10 11:55:39,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=14549, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15440, PETRI_PLACES=473, PETRI_TRANSITIONS=1298} [2023-11-10 11:55:39,840 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 340 predicate places. [2023-11-10 11:55:39,840 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 1298 transitions, 15440 flow [2023-11-10 11:55:39,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:39,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:39,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:39,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:55:39,840 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:39,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash -356742241, now seen corresponding path program 4 times [2023-11-10 11:55:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:39,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988053817] [2023-11-10 11:55:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:39,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:40,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988053817] [2023-11-10 11:55:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988053817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:55:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083532200] [2023-11-10 11:55:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:55:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:55:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:55:40,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2023-11-10 11:55:40,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1298 transitions, 15440 flow. Second operand has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:40,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:40,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2023-11-10 11:55:40,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:55:47,813 INFO L124 PetriNetUnfolderBase]: 7693/18232 cut-off events. [2023-11-10 11:55:47,813 INFO L125 PetriNetUnfolderBase]: For 214079/214900 co-relation queries the response was YES. [2023-11-10 11:55:48,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102896 conditions, 18232 events. 7693/18232 cut-off events. For 214079/214900 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 166224 event pairs, 963 based on Foata normal form. 198/17721 useless extension candidates. Maximal degree in co-relation 102759. Up to 5994 conditions per place. [2023-11-10 11:55:48,215 INFO L140 encePairwiseOnDemand]: 109/140 looper letters, 1053 selfloop transitions, 1033 changer transitions 0/2182 dead transitions. [2023-11-10 11:55:48,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 2182 transitions, 29986 flow [2023-11-10 11:55:48,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-10 11:55:48,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-11-10 11:55:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5960 transitions. [2023-11-10 11:55:48,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457875457875457 [2023-11-10 11:55:48,226 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 5960 transitions. [2023-11-10 11:55:48,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 5960 transitions. [2023-11-10 11:55:48,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:55:48,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 5960 transitions. [2023-11-10 11:55:48,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 76.41025641025641) internal successors, (5960), 78 states have internal predecessors, (5960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:48,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 140.0) internal successors, (11060), 79 states have internal predecessors, (11060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:48,249 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 140.0) internal successors, (11060), 79 states have internal predecessors, (11060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:48,249 INFO L175 Difference]: Start difference. First operand has 473 places, 1298 transitions, 15440 flow. Second operand 78 states and 5960 transitions. [2023-11-10 11:55:48,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 2182 transitions, 29986 flow [2023-11-10 11:55:49,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 2182 transitions, 29693 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-11-10 11:55:49,863 INFO L231 Difference]: Finished difference. Result has 584 places, 1693 transitions, 24940 flow [2023-11-10 11:55:49,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=15260, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=689, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=24940, PETRI_PLACES=584, PETRI_TRANSITIONS=1693} [2023-11-10 11:55:49,865 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 451 predicate places. [2023-11-10 11:55:49,865 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 1693 transitions, 24940 flow [2023-11-10 11:55:49,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:49,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:55:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:55:49,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:55:49,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:55:49,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:55:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash -562074941, now seen corresponding path program 5 times [2023-11-10 11:55:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:55:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027041582] [2023-11-10 11:55:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:55:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:55:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:55:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:55:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:55:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027041582] [2023-11-10 11:55:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027041582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:55:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:55:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:55:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974418061] [2023-11-10 11:55:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:55:50,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:55:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:55:50,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:55:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:55:50,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2023-11-10 11:55:50,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 1693 transitions, 24940 flow. Second operand has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:55:50,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:55:50,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2023-11-10 11:55:50,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:02,269 INFO L124 PetriNetUnfolderBase]: 9381/24091 cut-off events. [2023-11-10 11:56:02,270 INFO L125 PetriNetUnfolderBase]: For 367450/367902 co-relation queries the response was YES. [2023-11-10 11:56:02,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142811 conditions, 24091 events. 9381/24091 cut-off events. For 367450/367902 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 240800 event pairs, 1584 based on Foata normal form. 163/23289 useless extension candidates. Maximal degree in co-relation 142638. Up to 7513 conditions per place. [2023-11-10 11:56:02,709 INFO L140 encePairwiseOnDemand]: 109/140 looper letters, 1754 selfloop transitions, 1029 changer transitions 0/2879 dead transitions. [2023-11-10 11:56:02,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 2879 transitions, 48537 flow [2023-11-10 11:56:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-10 11:56:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-11-10 11:56:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 5194 transitions. [2023-11-10 11:56:02,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5621212121212121 [2023-11-10 11:56:02,715 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 5194 transitions. [2023-11-10 11:56:02,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 5194 transitions. [2023-11-10 11:56:02,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:02,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 5194 transitions. [2023-11-10 11:56:02,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 78.6969696969697) internal successors, (5194), 66 states have internal predecessors, (5194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:02,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 140.0) internal successors, (9380), 67 states have internal predecessors, (9380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:02,729 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 140.0) internal successors, (9380), 67 states have internal predecessors, (9380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:02,729 INFO L175 Difference]: Start difference. First operand has 584 places, 1693 transitions, 24940 flow. Second operand 66 states and 5194 transitions. [2023-11-10 11:56:02,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 2879 transitions, 48537 flow [2023-11-10 11:56:06,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 2879 transitions, 46429 flow, removed 1054 selfloop flow, removed 0 redundant places. [2023-11-10 11:56:06,775 INFO L231 Difference]: Finished difference. Result has 698 places, 2293 transitions, 37139 flow [2023-11-10 11:56:06,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=22868, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1024, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=37139, PETRI_PLACES=698, PETRI_TRANSITIONS=2293} [2023-11-10 11:56:06,778 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 565 predicate places. [2023-11-10 11:56:06,779 INFO L495 AbstractCegarLoop]: Abstraction has has 698 places, 2293 transitions, 37139 flow [2023-11-10 11:56:06,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:06,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:06,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:06,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:56:06,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:56:06,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1287971565, now seen corresponding path program 6 times [2023-11-10 11:56:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:06,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46171087] [2023-11-10 11:56:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:07,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46171087] [2023-11-10 11:56:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46171087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:07,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:07,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-10 11:56:07,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432626800] [2023-11-10 11:56:07,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:07,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-10 11:56:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-10 11:56:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-10 11:56:07,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 140 [2023-11-10 11:56:07,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 2293 transitions, 37139 flow. Second operand has 14 states, 14 states have (on average 74.42857142857143) internal successors, (1042), 14 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:07,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:07,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 140 [2023-11-10 11:56:07,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:23,369 INFO L124 PetriNetUnfolderBase]: 9712/25851 cut-off events. [2023-11-10 11:56:23,370 INFO L125 PetriNetUnfolderBase]: For 623925/626111 co-relation queries the response was YES. [2023-11-10 11:56:23,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179276 conditions, 25851 events. 9712/25851 cut-off events. For 623925/626111 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 270137 event pairs, 1266 based on Foata normal form. 288/25225 useless extension candidates. Maximal degree in co-relation 179053. Up to 8040 conditions per place. [2023-11-10 11:56:23,952 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 1865 selfloop transitions, 1442 changer transitions 0/3487 dead transitions. [2023-11-10 11:56:23,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 3487 transitions, 62638 flow [2023-11-10 11:56:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-10 11:56:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-11-10 11:56:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 5235 transitions. [2023-11-10 11:56:23,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5752747252747252 [2023-11-10 11:56:23,956 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 5235 transitions. [2023-11-10 11:56:23,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 5235 transitions. [2023-11-10 11:56:23,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:23,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 5235 transitions. [2023-11-10 11:56:23,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 80.53846153846153) internal successors, (5235), 65 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:23,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 140.0) internal successors, (9240), 66 states have internal predecessors, (9240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:23,969 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 140.0) internal successors, (9240), 66 states have internal predecessors, (9240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:23,969 INFO L175 Difference]: Start difference. First operand has 698 places, 2293 transitions, 37139 flow. Second operand 65 states and 5235 transitions. [2023-11-10 11:56:23,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 762 places, 3487 transitions, 62638 flow [2023-11-10 11:56:29,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 761 places, 3487 transitions, 61118 flow, removed 740 selfloop flow, removed 1 redundant places. [2023-11-10 11:56:30,014 INFO L231 Difference]: Finished difference. Result has 807 places, 2969 transitions, 53484 flow [2023-11-10 11:56:30,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=35665, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=865, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=53484, PETRI_PLACES=807, PETRI_TRANSITIONS=2969} [2023-11-10 11:56:30,017 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 674 predicate places. [2023-11-10 11:56:30,017 INFO L495 AbstractCegarLoop]: Abstraction has has 807 places, 2969 transitions, 53484 flow [2023-11-10 11:56:30,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 74.42857142857143) internal successors, (1042), 14 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:30,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:56:30,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:56:30,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:56:30,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:56:30,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:56:30,018 INFO L85 PathProgramCache]: Analyzing trace with hash 398081156, now seen corresponding path program 4 times [2023-11-10 11:56:30,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:56:30,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61477408] [2023-11-10 11:56:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:56:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:56:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:56:30,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:56:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:56:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61477408] [2023-11-10 11:56:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61477408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:56:30,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:56:30,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-10 11:56:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474168669] [2023-11-10 11:56:30,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:56:30,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-10 11:56:30,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:56:30,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-10 11:56:30,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-10 11:56:30,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 140 [2023-11-10 11:56:30,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 807 places, 2969 transitions, 53484 flow. Second operand has 18 states, 18 states have (on average 67.33333333333333) internal successors, (1212), 18 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:30,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:56:30,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 140 [2023-11-10 11:56:30,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:56:49,842 INFO L124 PetriNetUnfolderBase]: 8946/25734 cut-off events. [2023-11-10 11:56:49,843 INFO L125 PetriNetUnfolderBase]: For 668589/670415 co-relation queries the response was YES. [2023-11-10 11:56:50,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181043 conditions, 25734 events. 8946/25734 cut-off events. For 668589/670415 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 277461 event pairs, 1224 based on Foata normal form. 429/25096 useless extension candidates. Maximal degree in co-relation 180775. Up to 8710 conditions per place. [2023-11-10 11:56:50,450 INFO L140 encePairwiseOnDemand]: 108/140 looper letters, 2119 selfloop transitions, 1126 changer transitions 0/3695 dead transitions. [2023-11-10 11:56:50,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 855 places, 3695 transitions, 71538 flow [2023-11-10 11:56:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-10 11:56:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-10 11:56:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 3702 transitions. [2023-11-10 11:56:50,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396501457725947 [2023-11-10 11:56:50,453 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 3702 transitions. [2023-11-10 11:56:50,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 3702 transitions. [2023-11-10 11:56:50,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:56:50,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 3702 transitions. [2023-11-10 11:56:50,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 75.55102040816327) internal successors, (3702), 49 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:50,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 140.0) internal successors, (7000), 50 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:50,466 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 140.0) internal successors, (7000), 50 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:56:50,466 INFO L175 Difference]: Start difference. First operand has 807 places, 2969 transitions, 53484 flow. Second operand 49 states and 3702 transitions. [2023-11-10 11:56:50,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 855 places, 3695 transitions, 71538 flow [2023-11-10 11:57:01,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 855 places, 3695 transitions, 69426 flow, removed 1056 selfloop flow, removed 0 redundant places. [2023-11-10 11:57:01,491 INFO L231 Difference]: Finished difference. Result has 879 places, 3088 transitions, 57628 flow [2023-11-10 11:57:01,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=51207, PETRI_DIFFERENCE_MINUEND_PLACES=807, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1896, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=57628, PETRI_PLACES=879, PETRI_TRANSITIONS=3088} [2023-11-10 11:57:01,494 INFO L281 CegarLoopForPetriNet]: 133 programPoint places, 746 predicate places. [2023-11-10 11:57:01,494 INFO L495 AbstractCegarLoop]: Abstraction has has 879 places, 3088 transitions, 57628 flow [2023-11-10 11:57:01,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 67.33333333333333) internal successors, (1212), 18 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:57:01,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:57:01,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:57:01,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:57:01,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:57:01,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:57:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 231241269, now seen corresponding path program 7 times [2023-11-10 11:57:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:57:01,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041775984] [2023-11-10 11:57:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:57:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:57:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:57:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:57:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:57:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041775984] [2023-11-10 11:57:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041775984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:57:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:57:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-10 11:57:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755074761] [2023-11-10 11:57:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:57:01,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-10 11:57:01,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:57:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-10 11:57:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-11-10 11:57:01,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 140 [2023-11-10 11:57:01,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 879 places, 3088 transitions, 57628 flow. Second operand has 15 states, 15 states have (on average 70.4) internal successors, (1056), 15 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:57:01,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:57:01,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 140 [2023-11-10 11:57:01,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand