/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:21:29,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:21:29,598 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-12-09 15:21:29,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:21:29,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:21:29,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:21:29,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:21:29,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:21:29,625 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:21:29,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:21:29,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:21:29,628 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:21:29,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:21:29,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:21:29,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:21:29,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:21:29,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:21:29,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:21:29,630 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:21:29,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:21:29,630 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:21:29,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:21:29,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:21:29,631 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:21:29,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:21:29,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:21:29,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:21:29,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:21:29,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:21:29,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:21:29,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:21:29,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:21:29,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:21:29,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:21:29,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:21:29,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:21:29,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:21:29,817 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:21:29,817 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:21:29,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2023-12-09 15:21:30,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:21:31,023 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:21:31,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2023-12-09 15:21:31,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5410a3218/83549d5c763a41be9c54a41a1402ab4b/FLAG1ab0359d8 [2023-12-09 15:21:31,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5410a3218/83549d5c763a41be9c54a41a1402ab4b [2023-12-09 15:21:31,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:21:31,050 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:21:31,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:21:31,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:21:31,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:21:31,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e96dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31, skipping insertion in model container [2023-12-09 15:21:31,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:21:31,229 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2023-12-09 15:21:31,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:21:31,243 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:21:31,271 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2023-12-09 15:21:31,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:21:31,280 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:21:31,281 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:21:31,288 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:21:31,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31 WrapperNode [2023-12-09 15:21:31,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:21:31,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:21:31,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:21:31,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:21:31,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,329 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 352 [2023-12-09 15:21:31,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:21:31,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:21:31,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:21:31,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:21:31,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:21:31,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:21:31,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:21:31,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:21:31,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (1/1) ... [2023-12-09 15:21:31,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:21:31,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:21:31,399 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-12-09 15:21:31,417 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-12-09 15:21:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:21:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:21:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:21:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:21:31,443 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:21:31,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:21:31,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:21:31,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:21:31,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:21:31,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:21:31,446 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:21:31,532 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:21:31,534 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:21:31,900 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:21:32,095 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:21:32,095 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-09 15:21:32,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:21:32 BoogieIcfgContainer [2023-12-09 15:21:32,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:21:32,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:21:32,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:21:32,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:21:32,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:21:31" (1/3) ... [2023-12-09 15:21:32,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773c1e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:21:32, skipping insertion in model container [2023-12-09 15:21:32,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:21:31" (2/3) ... [2023-12-09 15:21:32,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773c1e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:21:32, skipping insertion in model container [2023-12-09 15:21:32,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:21:32" (3/3) ... [2023-12-09 15:21:32,107 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2023-12-09 15:21:32,120 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:21:32,120 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:21:32,120 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:21:32,169 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:21:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 286 transitions, 593 flow [2023-12-09 15:21:32,318 INFO L124 PetriNetUnfolderBase]: 27/283 cut-off events. [2023-12-09 15:21:32,318 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:21:32,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 283 events. 27/283 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 183 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 241. Up to 6 conditions per place. [2023-12-09 15:21:32,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 286 transitions, 593 flow [2023-12-09 15:21:32,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 272 transitions, 562 flow [2023-12-09 15:21:32,343 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:21:32,349 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@402e21f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:21:32,349 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:21:32,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:21:32,394 INFO L124 PetriNetUnfolderBase]: 27/271 cut-off events. [2023-12-09 15:21:32,394 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:21:32,394 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:32,394 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:21:32,395 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:32,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1527226769, now seen corresponding path program 1 times [2023-12-09 15:21:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398370631] [2023-12-09 15:21:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398370631] [2023-12-09 15:21:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398370631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:32,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 15:21:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634050010] [2023-12-09 15:21:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:32,725 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 15:21:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 15:21:32,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 15:21:32,755 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 286 [2023-12-09 15:21:32,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 272 transitions, 562 flow. Second operand has 2 states, 2 states have (on average 262.5) internal successors, (525), 2 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:32,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:32,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 286 [2023-12-09 15:21:32,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:32,827 INFO L124 PetriNetUnfolderBase]: 30/275 cut-off events. [2023-12-09 15:21:32,827 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-12-09 15:21:32,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 275 events. 30/275 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 173 event pairs, 0 based on Foata normal form. 19/272 useless extension candidates. Maximal degree in co-relation 246. Up to 31 conditions per place. [2023-12-09 15:21:32,830 INFO L140 encePairwiseOnDemand]: 273/286 looper letters, 14 selfloop transitions, 0 changer transitions 7/259 dead transitions. [2023-12-09 15:21:32,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 259 transitions, 564 flow [2023-12-09 15:21:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 15:21:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 15:21:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 543 transitions. [2023-12-09 15:21:32,844 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9493006993006993 [2023-12-09 15:21:32,844 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 543 transitions. [2023-12-09 15:21:32,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 543 transitions. [2023-12-09 15:21:32,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:32,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 543 transitions. [2023-12-09 15:21:32,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 271.5) internal successors, (543), 2 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:32,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:32,859 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:32,862 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 1 predicate places. [2023-12-09 15:21:32,863 INFO L500 AbstractCegarLoop]: Abstraction has has 256 places, 259 transitions, 564 flow [2023-12-09 15:21:32,863 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 262.5) internal successors, (525), 2 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:32,864 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:32,864 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:21:32,864 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:21:32,865 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:32,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:32,865 INFO L85 PathProgramCache]: Analyzing trace with hash -653156583, now seen corresponding path program 1 times [2023-12-09 15:21:32,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552612679] [2023-12-09 15:21:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:32,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552612679] [2023-12-09 15:21:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552612679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:21:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555912249] [2023-12-09 15:21:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:33,330 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:21:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:21:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:21:33,334 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 286 [2023-12-09 15:21:33,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 259 transitions, 564 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:33,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 286 [2023-12-09 15:21:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:33,510 INFO L124 PetriNetUnfolderBase]: 56/358 cut-off events. [2023-12-09 15:21:33,511 INFO L125 PetriNetUnfolderBase]: For 74/84 co-relation queries the response was YES. [2023-12-09 15:21:33,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 358 events. 56/358 cut-off events. For 74/84 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 474 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 367. Up to 60 conditions per place. [2023-12-09 15:21:33,515 INFO L140 encePairwiseOnDemand]: 271/286 looper letters, 65 selfloop transitions, 5 changer transitions 12/276 dead transitions. [2023-12-09 15:21:33,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 276 transitions, 803 flow [2023-12-09 15:21:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:21:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:21:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1532 transitions. [2023-12-09 15:21:33,518 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7652347652347652 [2023-12-09 15:21:33,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1532 transitions. [2023-12-09 15:21:33,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1532 transitions. [2023-12-09 15:21:33,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:33,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1532 transitions. [2023-12-09 15:21:33,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 218.85714285714286) internal successors, (1532), 7 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,525 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,526 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 7 predicate places. [2023-12-09 15:21:33,526 INFO L500 AbstractCegarLoop]: Abstraction has has 262 places, 276 transitions, 803 flow [2023-12-09 15:21:33,527 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,527 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:33,527 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:33,527 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:21:33,527 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:33,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash -972524005, now seen corresponding path program 1 times [2023-12-09 15:21:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:33,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593913584] [2023-12-09 15:21:33,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:33,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:33,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593913584] [2023-12-09 15:21:33,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593913584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:33,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:33,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:33,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732000617] [2023-12-09 15:21:33,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:33,660 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:33,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:33,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:33,668 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 286 [2023-12-09 15:21:33,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 276 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:33,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 286 [2023-12-09 15:21:33,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:33,781 INFO L124 PetriNetUnfolderBase]: 85/463 cut-off events. [2023-12-09 15:21:33,781 INFO L125 PetriNetUnfolderBase]: For 225/241 co-relation queries the response was YES. [2023-12-09 15:21:33,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 463 events. 85/463 cut-off events. For 225/241 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 960 event pairs, 0 based on Foata normal form. 10/422 useless extension candidates. Maximal degree in co-relation 439. Up to 93 conditions per place. [2023-12-09 15:21:33,784 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 43 selfloop transitions, 5 changer transitions 13/295 dead transitions. [2023-12-09 15:21:33,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 295 transitions, 1038 flow [2023-12-09 15:21:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:21:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:21:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2023-12-09 15:21:33,786 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2023-12-09 15:21:33,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2023-12-09 15:21:33,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2023-12-09 15:21:33,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:33,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2023-12-09 15:21:33,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,790 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 9 predicate places. [2023-12-09 15:21:33,790 INFO L500 AbstractCegarLoop]: Abstraction has has 264 places, 295 transitions, 1038 flow [2023-12-09 15:21:33,791 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,791 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:33,791 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:33,791 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:21:33,791 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:33,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1390729237, now seen corresponding path program 1 times [2023-12-09 15:21:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245956339] [2023-12-09 15:21:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:33,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245956339] [2023-12-09 15:21:33,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245956339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:33,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:33,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492807918] [2023-12-09 15:21:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:33,891 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:33,893 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 286 [2023-12-09 15:21:33,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 295 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:33,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:33,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 286 [2023-12-09 15:21:33,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:34,014 INFO L124 PetriNetUnfolderBase]: 153/732 cut-off events. [2023-12-09 15:21:34,014 INFO L125 PetriNetUnfolderBase]: For 724/818 co-relation queries the response was YES. [2023-12-09 15:21:34,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 732 events. 153/732 cut-off events. For 724/818 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2645 event pairs, 0 based on Foata normal form. 14/644 useless extension candidates. Maximal degree in co-relation 926. Up to 168 conditions per place. [2023-12-09 15:21:34,022 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 81 selfloop transitions, 5 changer transitions 15/335 dead transitions. [2023-12-09 15:21:34,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 335 transitions, 1586 flow [2023-12-09 15:21:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:21:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:21:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2023-12-09 15:21:34,024 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9242424242424242 [2023-12-09 15:21:34,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2023-12-09 15:21:34,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2023-12-09 15:21:34,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:34,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2023-12-09 15:21:34,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,029 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 11 predicate places. [2023-12-09 15:21:34,029 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 335 transitions, 1586 flow [2023-12-09 15:21:34,030 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,030 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:34,030 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:34,030 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:21:34,030 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:34,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:34,031 INFO L85 PathProgramCache]: Analyzing trace with hash -456484075, now seen corresponding path program 1 times [2023-12-09 15:21:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712087759] [2023-12-09 15:21:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:34,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712087759] [2023-12-09 15:21:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712087759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882302465] [2023-12-09 15:21:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:34,102 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:34,104 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 286 [2023-12-09 15:21:34,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 335 transitions, 1586 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:34,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 286 [2023-12-09 15:21:34,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:34,282 INFO L124 PetriNetUnfolderBase]: 317/1135 cut-off events. [2023-12-09 15:21:34,282 INFO L125 PetriNetUnfolderBase]: For 2877/3206 co-relation queries the response was YES. [2023-12-09 15:21:34,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 1135 events. 317/1135 cut-off events. For 2877/3206 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5602 event pairs, 21 based on Foata normal form. 17/981 useless extension candidates. Maximal degree in co-relation 2123. Up to 316 conditions per place. [2023-12-09 15:21:34,295 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 96 selfloop transitions, 13 changer transitions 17/359 dead transitions. [2023-12-09 15:21:34,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 359 transitions, 2075 flow [2023-12-09 15:21:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:21:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:21:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2023-12-09 15:21:34,297 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9195804195804196 [2023-12-09 15:21:34,297 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2023-12-09 15:21:34,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2023-12-09 15:21:34,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:34,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2023-12-09 15:21:34,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,301 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 13 predicate places. [2023-12-09 15:21:34,302 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 359 transitions, 2075 flow [2023-12-09 15:21:34,302 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,302 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:34,302 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:34,302 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:21:34,303 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:34,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2037247739, now seen corresponding path program 1 times [2023-12-09 15:21:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:34,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472342839] [2023-12-09 15:21:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:21:34,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:34,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472342839] [2023-12-09 15:21:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472342839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:34,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:34,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:21:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914693926] [2023-12-09 15:21:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:34,443 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:21:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:21:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:21:34,445 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 286 [2023-12-09 15:21:34,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 359 transitions, 2075 flow. Second operand has 6 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:34,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 286 [2023-12-09 15:21:34,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:34,757 INFO L124 PetriNetUnfolderBase]: 366/1517 cut-off events. [2023-12-09 15:21:34,757 INFO L125 PetriNetUnfolderBase]: For 5075/5566 co-relation queries the response was YES. [2023-12-09 15:21:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4165 conditions, 1517 events. 366/1517 cut-off events. For 5075/5566 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7991 event pairs, 29 based on Foata normal form. 35/1328 useless extension candidates. Maximal degree in co-relation 2380. Up to 369 conditions per place. [2023-12-09 15:21:34,773 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 195 selfloop transitions, 12 changer transitions 21/420 dead transitions. [2023-12-09 15:21:34,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 420 transitions, 2914 flow [2023-12-09 15:21:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:21:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:21:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2009 transitions. [2023-12-09 15:21:34,777 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7804972804972805 [2023-12-09 15:21:34,777 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2009 transitions. [2023-12-09 15:21:34,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2009 transitions. [2023-12-09 15:21:34,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:34,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2009 transitions. [2023-12-09 15:21:34,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 223.22222222222223) internal successors, (2009), 9 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,783 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,784 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 21 predicate places. [2023-12-09 15:21:34,784 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 420 transitions, 2914 flow [2023-12-09 15:21:34,785 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,785 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:34,785 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:34,785 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:21:34,785 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:34,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 940452381, now seen corresponding path program 1 times [2023-12-09 15:21:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644164195] [2023-12-09 15:21:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:21:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644164195] [2023-12-09 15:21:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644164195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:34,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:34,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736707498] [2023-12-09 15:21:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:34,854 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:34,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:34,856 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 286 [2023-12-09 15:21:34,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 420 transitions, 2914 flow. Second operand has 3 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:34,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:34,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 286 [2023-12-09 15:21:34,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:35,098 INFO L124 PetriNetUnfolderBase]: 501/1599 cut-off events. [2023-12-09 15:21:35,098 INFO L125 PetriNetUnfolderBase]: For 9239/9348 co-relation queries the response was YES. [2023-12-09 15:21:35,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5576 conditions, 1599 events. 501/1599 cut-off events. For 9239/9348 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7805 event pairs, 42 based on Foata normal form. 4/1359 useless extension candidates. Maximal degree in co-relation 4207. Up to 509 conditions per place. [2023-12-09 15:21:35,113 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 80 selfloop transitions, 12 changer transitions 54/380 dead transitions. [2023-12-09 15:21:35,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 380 transitions, 2511 flow [2023-12-09 15:21:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:21:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:21:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-12-09 15:21:35,115 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2023-12-09 15:21:35,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-12-09 15:21:35,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-12-09 15:21:35,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:35,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-12-09 15:21:35,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:35,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:35,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:35,119 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 23 predicate places. [2023-12-09 15:21:35,119 INFO L500 AbstractCegarLoop]: Abstraction has has 278 places, 380 transitions, 2511 flow [2023-12-09 15:21:35,119 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:35,119 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:35,119 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:35,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:21:35,120 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:35,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2028912291, now seen corresponding path program 1 times [2023-12-09 15:21:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346776718] [2023-12-09 15:21:35,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:36,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:36,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346776718] [2023-12-09 15:21:36,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346776718] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:21:36,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092366910] [2023-12-09 15:21:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:36,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:21:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:21:36,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:21:36,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:21:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:36,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-09 15:21:36,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:21:36,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:21:36,439 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-09 15:21:36,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-09 15:21:36,470 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-09 15:21:36,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-12-09 15:21:36,852 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-09 15:21:36,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2023-12-09 15:21:37,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:21:37,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:21:38,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:21:38,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:21:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:38,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:21:40,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:21:40,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2023-12-09 15:21:40,050 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:21:40,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1622 treesize of output 1497 [2023-12-09 15:21:40,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:21:40,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2023-12-09 15:21:40,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:21:40,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2023-12-09 15:21:40,098 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:21:40,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 42 [2023-12-09 15:21:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:21:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092366910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:21:40,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:21:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 20] total 54 [2023-12-09 15:21:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852277609] [2023-12-09 15:21:40,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:21:40,625 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-09 15:21:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:40,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-09 15:21:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2427, Unknown=51, NotChecked=0, Total=2862 [2023-12-09 15:21:40,631 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-12-09 15:21:40,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 380 transitions, 2511 flow. Second operand has 54 states, 54 states have (on average 122.0925925925926) internal successors, (6593), 54 states have internal predecessors, (6593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:40,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:40,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-12-09 15:21:40,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:47,817 INFO L124 PetriNetUnfolderBase]: 5641/13781 cut-off events. [2023-12-09 15:21:47,817 INFO L125 PetriNetUnfolderBase]: For 110126/112159 co-relation queries the response was YES. [2023-12-09 15:21:47,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56267 conditions, 13781 events. 5641/13781 cut-off events. For 110126/112159 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 129672 event pairs, 651 based on Foata normal form. 53/11345 useless extension candidates. Maximal degree in co-relation 41882. Up to 4802 conditions per place. [2023-12-09 15:21:48,086 INFO L140 encePairwiseOnDemand]: 237/286 looper letters, 573 selfloop transitions, 142 changer transitions 107/934 dead transitions. [2023-12-09 15:21:48,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 934 transitions, 11562 flow [2023-12-09 15:21:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-12-09 15:21:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-12-09 15:21:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 7827 transitions. [2023-12-09 15:21:48,100 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.42761145104895104 [2023-12-09 15:21:48,100 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 7827 transitions. [2023-12-09 15:21:48,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 7827 transitions. [2023-12-09 15:21:48,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:48,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 7827 transitions. [2023-12-09 15:21:48,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 122.296875) internal successors, (7827), 64 states have internal predecessors, (7827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:48,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 286.0) internal successors, (18590), 65 states have internal predecessors, (18590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:48,152 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 286.0) internal successors, (18590), 65 states have internal predecessors, (18590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:48,155 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 86 predicate places. [2023-12-09 15:21:48,155 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 934 transitions, 11562 flow [2023-12-09 15:21:48,156 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 122.0925925925926) internal successors, (6593), 54 states have internal predecessors, (6593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:48,156 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:48,157 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:48,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:21:48,362 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:21:48,363 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:48,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash 996021875, now seen corresponding path program 1 times [2023-12-09 15:21:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768082015] [2023-12-09 15:21:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:21:48,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:48,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768082015] [2023-12-09 15:21:48,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768082015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:48,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:48,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470700122] [2023-12-09 15:21:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:48,421 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:48,422 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 286 [2023-12-09 15:21:48,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 934 transitions, 11562 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:48,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:48,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 286 [2023-12-09 15:21:48,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:49,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][503], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 316#true, 1755#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((v_~manager_back~0_101 Int)) (and (= (select (select |#memory_int| ~manager~0.base) (* v_~manager_back~0_101 4)) ~update~0) (<= (+ v_~manager_back~0_101 1) ~manager_size~0) (<= 0 v_~manager_back~0_101) (<= ~manager_front~0 v_~manager_back~0_101))) (<= (+ ~manager~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~manager~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~manager_size~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~manager~0.offset 0) (<= ~manager_front~0 ~manager_back~0) (not (= ~manager~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), thread3Thread1of1ForFork0InUse, 275#true, thread1Thread1of1ForFork1InUse, 252#L74true, 295#true, thread2Thread1of1ForFork2InUse, 221#L156-4true, 272#true, 293#(<= ~node_back~0 ~node_front~0), 287#true, 178#L89true]) [2023-12-09 15:21:49,929 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-12-09 15:21:49,929 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:49,929 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:49,929 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:50,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1024] L74-->L73-1: Formula: (and (= v_~manager_state~0_32 0) (not (= (ite (= v_~ok~0_55 (select (select |v_#memory_int_136| v_~client~0.base_29) (+ (* v_~client_back~0_49 4) v_~client~0.offset_29))) 1 0) 0)) (not (= (ite (and (<= 0 v_~client_back~0_49) (< v_~client_back~0_49 v_~client_size~0_22)) 1 0) 0)) (= (+ v_~client_back~0_49 1) v_~client_back~0_48)) InVars {~client_back~0=v_~client_back~0_49, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, ~client~0.base=v_~client~0.base_29} OutVars{~manager_state~0=v_~manager_state~0_32, ~client_back~0=v_~client_back~0_48, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork1_#t~mem8#1=|v_thread1Thread1of1ForFork1_#t~mem8#1_1|, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, thread1Thread1of1ForFork1_#t~post9#1=|v_thread1Thread1of1ForFork1_#t~post9#1_1|, ~client~0.base=v_~client~0.base_29, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[~manager_state~0, ~client_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][561], [1789#(= ~node_state~0 0), 170#L73-1true, 299#true, 1755#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((v_~manager_back~0_101 Int)) (and (= (select (select |#memory_int| ~manager~0.base) (* v_~manager_back~0_101 4)) ~update~0) (<= (+ v_~manager_back~0_101 1) ~manager_size~0) (<= 0 v_~manager_back~0_101) (<= ~manager_front~0 v_~manager_back~0_101))) (<= (+ ~manager~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~manager~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~manager_size~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~manager~0.offset 0) (<= ~manager_front~0 ~manager_back~0) (not (= ~manager~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 221#L156-4true, 318#(= ~manager_state~0 0), 272#true, 293#(<= ~node_back~0 ~node_front~0), 178#L89true, 287#true]) [2023-12-09 15:21:50,092 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is not cut-off event [2023-12-09 15:21:50,092 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2023-12-09 15:21:50,092 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2023-12-09 15:21:50,092 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is not cut-off event [2023-12-09 15:21:50,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 174#L59true, 295#true, thread2Thread1of1ForFork2InUse, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true, 178#L89true]) [2023-12-09 15:21:50,114 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,114 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:50,114 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:50,118 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:50,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 174#L59true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:21:50,122 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,122 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:50,122 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:50,122 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-12-09 15:21:50,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L60-->L73-1: Formula: (and (= v_~manager_state~0_28 2) (= (+ v_~node_back~0_43 1) v_~node_back~0_42) (not (= (ite (and (< v_~node_back~0_43 v_~node_size~0_20) (<= 0 v_~node_back~0_43)) 1 0) 0)) (not (= (ite (= v_~update~0_43 (select (select |v_#memory_int_120| v_~node~0.base_27) (+ (* v_~node_back~0_43 4) v_~node~0.offset_27))) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_43, ~node_size~0=v_~node_size~0_20, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, ~update~0=v_~update~0_43} OutVars{~node_back~0=v_~node_back~0_42, ~manager_state~0=v_~manager_state~0_28, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~node_size~0=v_~node_size~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_43} AuxVars[] AssignedVars[~node_back~0, ~manager_state~0, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][566], [1789#(= ~node_state~0 0), 170#L73-1true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,300 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,300 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,300 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,300 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, 133#L60true, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 295#true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,300 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,300 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,301 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,301 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, 133#L60true, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:21:50,301 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,301 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,301 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,301 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 59#L66true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 295#true, thread2Thread1of1ForFork2InUse, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,302 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,302 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,302 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,302 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 59#L66true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:21:50,303 INFO L294 olderBase$Statistics]: this new event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,303 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,303 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:50,303 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-12-09 15:21:50,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][503], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 316#true, 1755#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((v_~manager_back~0_101 Int)) (and (= (select (select |#memory_int| ~manager~0.base) (* v_~manager_back~0_101 4)) ~update~0) (<= (+ v_~manager_back~0_101 1) ~manager_size~0) (<= 0 v_~manager_back~0_101) (<= ~manager_front~0 v_~manager_back~0_101))) (<= (+ ~manager~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~manager~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~manager_size~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~manager~0.offset 0) (<= ~manager_front~0 ~manager_back~0) (not (= ~manager~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 252#L74true, thread2Thread1of1ForFork2InUse, 295#true, 15#L157-1true, 272#true, 293#(<= ~node_back~0 ~node_front~0), 178#L89true, 287#true]) [2023-12-09 15:21:50,458 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,458 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,458 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,458 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L67-->L73-1: Formula: (and (= (ite (= (ite (= (select (select |v_#memory_int_124| v_~manager~0.base_59) (+ (* v_~manager_front~0_69 4) v_~manager~0.offset_59)) v_~ok~0_49) 1 0) 0) 0 1) v_~safe~0_60) (not (= (ite (and (< v_~manager_front~0_69 v_~manager_back~0_87) (<= 0 v_~manager_front~0_69) (< v_~manager_front~0_69 v_~manager_size~0_28)) 1 0) 0)) (= v_~manager_state~0_30 3) (= v_~manager_front~0_68 (+ v_~manager_front~0_69 1))) InVars {~manager_front~0=v_~manager_front~0_69, ~manager~0.offset=v_~manager~0.offset_59, ~ok~0=v_~ok~0_49, ~manager~0.base=v_~manager~0.base_59, #memory_int=|v_#memory_int_124|, ~manager_back~0=v_~manager_back~0_87, ~manager_size~0=v_~manager_size~0_28} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_1|, ~manager_state~0=v_~manager_state~0_30, ~manager~0.offset=v_~manager~0.offset_59, ~ok~0=v_~ok~0_49, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_1|, ~manager~0.base=v_~manager~0.base_59, ~manager_back~0=v_~manager_back~0_87, ~manager_front~0=v_~manager_front~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~safe~0=v_~safe~0_60, #memory_int=|v_#memory_int_124|, ~manager_size~0=v_~manager_size~0_28, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~manager_front~0, thread1Thread1of1ForFork1_#t~post7#1, ~manager_state~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][582], [170#L73-1true, 1789#(= ~node_state~0 0), 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true, 178#L89true]) [2023-12-09 15:21:50,500 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,500 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,500 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,500 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 316#true, 192#L67true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 295#true, thread2Thread1of1ForFork2InUse, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,501 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,501 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,501 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,501 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, 192#L67true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:21:50,501 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,501 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,502 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,502 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 32#L73true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 295#true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,503 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,503 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,503 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,503 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 32#L73true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:21:50,503 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,503 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,516 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2023-12-09 15:21:50,516 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2023-12-09 15:21:50,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1024] L74-->L73-1: Formula: (and (= v_~manager_state~0_32 0) (not (= (ite (= v_~ok~0_55 (select (select |v_#memory_int_136| v_~client~0.base_29) (+ (* v_~client_back~0_49 4) v_~client~0.offset_29))) 1 0) 0)) (not (= (ite (and (<= 0 v_~client_back~0_49) (< v_~client_back~0_49 v_~client_size~0_22)) 1 0) 0)) (= (+ v_~client_back~0_49 1) v_~client_back~0_48)) InVars {~client_back~0=v_~client_back~0_49, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, ~client~0.base=v_~client~0.base_29} OutVars{~manager_state~0=v_~manager_state~0_32, ~client_back~0=v_~client_back~0_48, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork1_#t~mem8#1=|v_thread1Thread1of1ForFork1_#t~mem8#1_1|, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, thread1Thread1of1ForFork1_#t~post9#1=|v_thread1Thread1of1ForFork1_#t~post9#1_1|, ~client~0.base=v_~client~0.base_29, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[~manager_state~0, ~client_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][561], [170#L73-1true, 1789#(= ~node_state~0 0), 299#true, 1755#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (exists ((v_~manager_back~0_101 Int)) (and (= (select (select |#memory_int| ~manager~0.base) (* v_~manager_back~0_101 4)) ~update~0) (<= (+ v_~manager_back~0_101 1) ~manager_size~0) (<= 0 v_~manager_back~0_101) (<= ~manager_front~0 v_~manager_back~0_101))) (<= (+ ~manager~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~manager~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~manager_size~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~manager~0.offset 0) (<= ~manager_front~0 ~manager_back~0) (not (= ~manager~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), thread3Thread1of1ForFork0InUse, 275#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 15#L157-1true, 318#(= ~manager_state~0 0), 272#true, 293#(<= ~node_back~0 ~node_front~0), 287#true, 178#L89true]) [2023-12-09 15:21:50,783 INFO L294 olderBase$Statistics]: this new event has 213 ancestors and is not cut-off event [2023-12-09 15:21:50,783 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is not cut-off event [2023-12-09 15:21:50,783 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is not cut-off event [2023-12-09 15:21:50,783 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is not cut-off event [2023-12-09 15:21:50,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 174#L59true, thread2Thread1of1ForFork2InUse, 295#true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,808 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 174#L59true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 15#L157-1true, 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:21:50,808 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,808 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 252#L74true, 295#true, thread2Thread1of1ForFork2InUse, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true, 178#L89true]) [2023-12-09 15:21:50,810 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1024] L74-->L73-1: Formula: (and (= v_~manager_state~0_32 0) (not (= (ite (= v_~ok~0_55 (select (select |v_#memory_int_136| v_~client~0.base_29) (+ (* v_~client_back~0_49 4) v_~client~0.offset_29))) 1 0) 0)) (not (= (ite (and (<= 0 v_~client_back~0_49) (< v_~client_back~0_49 v_~client_size~0_22)) 1 0) 0)) (= (+ v_~client_back~0_49 1) v_~client_back~0_48)) InVars {~client_back~0=v_~client_back~0_49, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, ~client~0.base=v_~client~0.base_29} OutVars{~manager_state~0=v_~manager_state~0_32, ~client_back~0=v_~client_back~0_48, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork1_#t~mem8#1=|v_thread1Thread1of1ForFork1_#t~mem8#1_1|, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, thread1Thread1of1ForFork1_#t~post9#1=|v_thread1Thread1of1ForFork1_#t~post9#1_1|, ~client~0.base=v_~client~0.base_29, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[~manager_state~0, ~client_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][611], [170#L73-1true, 1789#(= ~node_state~0 0), 299#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 318#(= ~manager_state~0 0), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,810 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 252#L74true, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:21:50,811 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,811 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,811 INFO L297 olderBase$Statistics]: existing Event has 213 ancestors and is cut-off event [2023-12-09 15:21:50,811 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-12-09 15:21:50,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L60-->L73-1: Formula: (and (= v_~manager_state~0_28 2) (= (+ v_~node_back~0_43 1) v_~node_back~0_42) (not (= (ite (and (< v_~node_back~0_43 v_~node_size~0_20) (<= 0 v_~node_back~0_43)) 1 0) 0)) (not (= (ite (= v_~update~0_43 (select (select |v_#memory_int_120| v_~node~0.base_27) (+ (* v_~node_back~0_43 4) v_~node~0.offset_27))) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_43, ~node_size~0=v_~node_size~0_20, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, ~update~0=v_~update~0_43} OutVars{~node_back~0=v_~node_back~0_42, ~manager_state~0=v_~manager_state~0_28, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~node_size~0=v_~node_size~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_43} AuxVars[] AssignedVars[~node_back~0, ~manager_state~0, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][566], [170#L73-1true, 1789#(= ~node_state~0 0), 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,963 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, 133#L60true, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 295#true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:50,963 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,963 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, 133#L60true, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:21:50,964 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-12-09 15:21:50,964 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,964 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,964 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 59#L66true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 295#true, thread2Thread1of1ForFork2InUse, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true, 178#L89true]) [2023-12-09 15:21:50,965 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 59#L66true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:21:50,965 INFO L294 olderBase$Statistics]: this new event has 220 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-12-09 15:21:50,965 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2023-12-09 15:21:51,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L67-->L73-1: Formula: (and (= (ite (= (ite (= (select (select |v_#memory_int_124| v_~manager~0.base_59) (+ (* v_~manager_front~0_69 4) v_~manager~0.offset_59)) v_~ok~0_49) 1 0) 0) 0 1) v_~safe~0_60) (not (= (ite (and (< v_~manager_front~0_69 v_~manager_back~0_87) (<= 0 v_~manager_front~0_69) (< v_~manager_front~0_69 v_~manager_size~0_28)) 1 0) 0)) (= v_~manager_state~0_30 3) (= v_~manager_front~0_68 (+ v_~manager_front~0_69 1))) InVars {~manager_front~0=v_~manager_front~0_69, ~manager~0.offset=v_~manager~0.offset_59, ~ok~0=v_~ok~0_49, ~manager~0.base=v_~manager~0.base_59, #memory_int=|v_#memory_int_124|, ~manager_back~0=v_~manager_back~0_87, ~manager_size~0=v_~manager_size~0_28} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_1|, ~manager_state~0=v_~manager_state~0_30, ~manager~0.offset=v_~manager~0.offset_59, ~ok~0=v_~ok~0_49, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_1|, ~manager~0.base=v_~manager~0.base_59, ~manager_back~0=v_~manager_back~0_87, ~manager_front~0=v_~manager_front~0_68, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~safe~0=v_~safe~0_60, #memory_int=|v_#memory_int_124|, ~manager_size~0=v_~manager_size~0_28, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[~manager_front~0, thread1Thread1of1ForFork1_#t~post7#1, ~manager_state~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~safe~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][582], [170#L73-1true, 1789#(= ~node_state~0 0), 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 15#L157-1true, 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:51,112 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,112 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,112 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-12-09 15:21:51,112 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 316#true, 192#L67true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 295#true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true, 178#L89true]) [2023-12-09 15:21:51,113 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, 192#L67true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 15#L157-1true, 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:21:51,113 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 32#L73true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 295#true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:51,113 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,113 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,114 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,114 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-12-09 15:21:51,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 32#L73true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:21:51,114 INFO L294 olderBase$Statistics]: this new event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,114 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,114 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2023-12-09 15:21:51,114 INFO L297 olderBase$Statistics]: existing Event has 220 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][544], [1789#(= ~node_state~0 0), 20#L117-1true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 252#L74true, 295#true, thread2Thread1of1ForFork2InUse, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true, 178#L89true]) [2023-12-09 15:21:51,259 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1024] L74-->L73-1: Formula: (and (= v_~manager_state~0_32 0) (not (= (ite (= v_~ok~0_55 (select (select |v_#memory_int_136| v_~client~0.base_29) (+ (* v_~client_back~0_49 4) v_~client~0.offset_29))) 1 0) 0)) (not (= (ite (and (<= 0 v_~client_back~0_49) (< v_~client_back~0_49 v_~client_size~0_22)) 1 0) 0)) (= (+ v_~client_back~0_49 1) v_~client_back~0_48)) InVars {~client_back~0=v_~client_back~0_49, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, ~client~0.base=v_~client~0.base_29} OutVars{~manager_state~0=v_~manager_state~0_32, ~client_back~0=v_~client_back~0_48, ~client~0.offset=v_~client~0.offset_29, ~ok~0=v_~ok~0_55, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork1_#t~mem8#1=|v_thread1Thread1of1ForFork1_#t~mem8#1_1|, #memory_int=|v_#memory_int_136|, ~client_size~0=v_~client_size~0_22, thread1Thread1of1ForFork1_#t~post9#1=|v_thread1Thread1of1ForFork1_#t~post9#1_1|, ~client~0.base=v_~client~0.base_29, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[~manager_state~0, ~client_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem8#1, thread1Thread1of1ForFork1_#t~post9#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][611], [1789#(= ~node_state~0 0), 170#L73-1true, 299#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 15#L157-1true, 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 318#(= ~manager_state~0 0), 272#true, 178#L89true, 287#true]) [2023-12-09 15:21:51,259 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-12-09 15:21:51,259 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:51,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][546], [75#L95-1true, 1787#true, 299#true, 316#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, 252#L74true, thread2Thread1of1ForFork2InUse, 297#(= ~client_state~0 0), 194#L111true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:21:51,260 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2023-12-09 15:21:51,260 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:51,260 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2023-12-09 15:21:51,260 INFO L297 olderBase$Statistics]: existing Event has 221 ancestors and is cut-off event [2023-12-09 15:21:52,662 INFO L124 PetriNetUnfolderBase]: 9857/24875 cut-off events. [2023-12-09 15:21:52,663 INFO L125 PetriNetUnfolderBase]: For 243354/245154 co-relation queries the response was YES. [2023-12-09 15:21:52,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100233 conditions, 24875 events. 9857/24875 cut-off events. For 243354/245154 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 267349 event pairs, 1918 based on Foata normal form. 100/19755 useless extension candidates. Maximal degree in co-relation 77092. Up to 7542 conditions per place. [2023-12-09 15:21:52,907 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 436 selfloop transitions, 54 changer transitions 107/957 dead transitions. [2023-12-09 15:21:52,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 957 transitions, 13134 flow [2023-12-09 15:21:52,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:21:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:21:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2023-12-09 15:21:52,909 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9195804195804196 [2023-12-09 15:21:52,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2023-12-09 15:21:52,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2023-12-09 15:21:52,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:52,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2023-12-09 15:21:52,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:52,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:52,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:52,912 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 88 predicate places. [2023-12-09 15:21:52,912 INFO L500 AbstractCegarLoop]: Abstraction has has 343 places, 957 transitions, 13134 flow [2023-12-09 15:21:52,912 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:52,913 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:52,913 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:52,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:21:52,913 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:52,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1680881809, now seen corresponding path program 1 times [2023-12-09 15:21:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823251658] [2023-12-09 15:21:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 15:21:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823251658] [2023-12-09 15:21:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823251658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:53,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:53,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530903362] [2023-12-09 15:21:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:53,003 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:53,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:53,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:53,004 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 286 [2023-12-09 15:21:53,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 957 transitions, 13134 flow. Second operand has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:53,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:53,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 286 [2023-12-09 15:21:53,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:21:59,442 INFO L124 PetriNetUnfolderBase]: 14444/36441 cut-off events. [2023-12-09 15:21:59,442 INFO L125 PetriNetUnfolderBase]: For 480390/483805 co-relation queries the response was YES. [2023-12-09 15:21:59,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156838 conditions, 36441 events. 14444/36441 cut-off events. For 480390/483805 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 413303 event pairs, 2882 based on Foata normal form. 1031/29465 useless extension candidates. Maximal degree in co-relation 123962. Up to 10952 conditions per place. [2023-12-09 15:21:59,878 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 734 selfloop transitions, 37 changer transitions 148/1277 dead transitions. [2023-12-09 15:21:59,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1277 transitions, 21484 flow [2023-12-09 15:21:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:21:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:21:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-12-09 15:21:59,880 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.921911421911422 [2023-12-09 15:21:59,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-12-09 15:21:59,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-12-09 15:21:59,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:21:59,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-12-09 15:21:59,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:59,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:59,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:59,883 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 90 predicate places. [2023-12-09 15:21:59,883 INFO L500 AbstractCegarLoop]: Abstraction has has 345 places, 1277 transitions, 21484 flow [2023-12-09 15:21:59,884 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:59,884 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:21:59,884 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:21:59,884 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:21:59,884 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:21:59,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:21:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash 961529304, now seen corresponding path program 1 times [2023-12-09 15:21:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:21:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903255133] [2023-12-09 15:21:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:21:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:21:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:21:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:21:59,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:21:59,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903255133] [2023-12-09 15:21:59,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903255133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:21:59,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:21:59,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:21:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573373327] [2023-12-09 15:21:59,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:21:59,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:21:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:21:59,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:21:59,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:21:59,940 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 286 [2023-12-09 15:21:59,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 1277 transitions, 21484 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:21:59,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:21:59,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 286 [2023-12-09 15:21:59,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:07,670 INFO L124 PetriNetUnfolderBase]: 15702/38584 cut-off events. [2023-12-09 15:22:07,670 INFO L125 PetriNetUnfolderBase]: For 558084/566522 co-relation queries the response was YES. [2023-12-09 15:22:07,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183974 conditions, 38584 events. 15702/38584 cut-off events. For 558084/566522 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 431244 event pairs, 2900 based on Foata normal form. 171/30579 useless extension candidates. Maximal degree in co-relation 145157. Up to 12005 conditions per place. [2023-12-09 15:22:08,323 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 705 selfloop transitions, 115 changer transitions 165/1337 dead transitions. [2023-12-09 15:22:08,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 1337 transitions, 24784 flow [2023-12-09 15:22:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:22:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:22:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2023-12-09 15:22:08,327 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2023-12-09 15:22:08,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 781 transitions. [2023-12-09 15:22:08,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 781 transitions. [2023-12-09 15:22:08,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:08,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 781 transitions. [2023-12-09 15:22:08,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:08,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:08,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:08,336 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 92 predicate places. [2023-12-09 15:22:08,336 INFO L500 AbstractCegarLoop]: Abstraction has has 347 places, 1337 transitions, 24784 flow [2023-12-09 15:22:08,336 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:08,336 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:08,348 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:22:08,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:22:08,348 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:08,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1386122893, now seen corresponding path program 2 times [2023-12-09 15:22:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153481240] [2023-12-09 15:22:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:22:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153481240] [2023-12-09 15:22:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153481240] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:22:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173020220] [2023-12-09 15:22:09,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:22:09,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:09,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:22:09,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:22:09,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:22:09,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:22:09,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:22:09,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-09 15:22:09,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:22:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:22:10,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:22:10,210 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:22:10,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-12-09 15:22:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-09 15:22:10,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173020220] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:22:10,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:22:10,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7, 7] total 24 [2023-12-09 15:22:10,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877421201] [2023-12-09 15:22:10,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:22:10,348 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-09 15:22:10,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:10,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-09 15:22:10,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2023-12-09 15:22:10,351 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2023-12-09 15:22:10,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1337 transitions, 24784 flow. Second operand has 24 states, 24 states have (on average 138.70833333333334) internal successors, (3329), 24 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:10,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:10,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2023-12-09 15:22:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:20,309 INFO L124 PetriNetUnfolderBase]: 16323/41218 cut-off events. [2023-12-09 15:22:20,309 INFO L125 PetriNetUnfolderBase]: For 664668/674071 co-relation queries the response was YES. [2023-12-09 15:22:20,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205661 conditions, 41218 events. 16323/41218 cut-off events. For 664668/674071 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 471045 event pairs, 3066 based on Foata normal form. 122/32804 useless extension candidates. Maximal degree in co-relation 160041. Up to 13017 conditions per place. [2023-12-09 15:22:20,839 INFO L140 encePairwiseOnDemand]: 251/286 looper letters, 1142 selfloop transitions, 89 changer transitions 226/1579 dead transitions. [2023-12-09 15:22:20,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 1579 transitions, 31249 flow [2023-12-09 15:22:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-09 15:22:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-12-09 15:22:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5852 transitions. [2023-12-09 15:22:20,866 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47584973166368516 [2023-12-09 15:22:20,866 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 5852 transitions. [2023-12-09 15:22:20,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 5852 transitions. [2023-12-09 15:22:20,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:20,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 5852 transitions. [2023-12-09 15:22:20,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 136.09302325581396) internal successors, (5852), 43 states have internal predecessors, (5852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:20,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 286.0) internal successors, (12584), 44 states have internal predecessors, (12584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:20,895 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 286.0) internal successors, (12584), 44 states have internal predecessors, (12584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:20,908 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 134 predicate places. [2023-12-09 15:22:20,908 INFO L500 AbstractCegarLoop]: Abstraction has has 389 places, 1579 transitions, 31249 flow [2023-12-09 15:22:20,909 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 138.70833333333334) internal successors, (3329), 24 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:20,909 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:20,909 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:22:20,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:22:21,114 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-09 15:22:21,115 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:21,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1066300941, now seen corresponding path program 1 times [2023-12-09 15:22:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975451858] [2023-12-09 15:22:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 15:22:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975451858] [2023-12-09 15:22:21,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975451858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:22:21,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:22:21,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:22:21,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459519933] [2023-12-09 15:22:21,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:22:21,258 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:22:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:22:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:22:21,260 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 286 [2023-12-09 15:22:21,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 1579 transitions, 31249 flow. Second operand has 6 states, 6 states have (on average 219.16666666666666) internal successors, (1315), 6 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:21,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:21,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 286 [2023-12-09 15:22:21,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:30,635 INFO L124 PetriNetUnfolderBase]: 16647/43993 cut-off events. [2023-12-09 15:22:30,636 INFO L125 PetriNetUnfolderBase]: For 788992/799004 co-relation queries the response was YES. [2023-12-09 15:22:30,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220975 conditions, 43993 events. 16647/43993 cut-off events. For 788992/799004 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 513604 event pairs, 3171 based on Foata normal form. 152/35555 useless extension candidates. Maximal degree in co-relation 165352. Up to 12633 conditions per place. [2023-12-09 15:22:31,234 INFO L140 encePairwiseOnDemand]: 275/286 looper letters, 1016 selfloop transitions, 20 changer transitions 315/1680 dead transitions. [2023-12-09 15:22:31,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1680 transitions, 36001 flow [2023-12-09 15:22:31,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:22:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:22:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1977 transitions. [2023-12-09 15:22:31,236 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7680652680652681 [2023-12-09 15:22:31,236 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1977 transitions. [2023-12-09 15:22:31,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1977 transitions. [2023-12-09 15:22:31,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:22:31,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1977 transitions. [2023-12-09 15:22:31,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 219.66666666666666) internal successors, (1977), 9 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:31,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:31,241 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 286.0) internal successors, (2860), 10 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:31,241 INFO L308 CegarLoopForPetriNet]: 255 programPoint places, 142 predicate places. [2023-12-09 15:22:31,242 INFO L500 AbstractCegarLoop]: Abstraction has has 397 places, 1680 transitions, 36001 flow [2023-12-09 15:22:31,242 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.16666666666666) internal successors, (1315), 6 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:31,242 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:22:31,242 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-09 15:22:31,242 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 15:22:31,242 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:22:31,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:22:31,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1059849158, now seen corresponding path program 1 times [2023-12-09 15:22:31,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:22:31,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268124818] [2023-12-09 15:22:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:31,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:22:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:32,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 15:22:32,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:22:32,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268124818] [2023-12-09 15:22:32,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268124818] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:22:32,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139118103] [2023-12-09 15:22:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:22:32,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:22:32,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:22:32,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:22:32,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:22:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:22:32,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-09 15:22:32,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:22:32,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:22:33,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:22:33,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:22:33,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:22:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 15:22:33,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:22:37,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:22:37,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2023-12-09 15:22:37,093 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:22:37,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 181 [2023-12-09 15:22:37,102 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:22:37,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 130 [2023-12-09 15:22:37,136 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:22:37,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 106 [2023-12-09 15:22:37,148 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:22:37,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2023-12-09 15:22:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 15:22:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139118103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:22:37,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:22:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 19] total 53 [2023-12-09 15:22:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43484049] [2023-12-09 15:22:37,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:22:37,996 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-09 15:22:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:22:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-09 15:22:37,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2353, Unknown=40, NotChecked=0, Total=2756 [2023-12-09 15:22:38,004 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 286 [2023-12-09 15:22:38,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1680 transitions, 36001 flow. Second operand has 53 states, 53 states have (on average 124.54716981132076) internal successors, (6601), 53 states have internal predecessors, (6601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:22:38,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:22:38,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 286 [2023-12-09 15:22:38,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:22:55,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][1722], [75#L95-1true, 3630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~node_front~0 ~node_back~0)), 1793#(<= ~client_back~0 ~client_front~0), 1787#true, 299#true, 3240#true, 316#true, 1797#(= ~manager_state~0 1), 133#L60true, thread3Thread1of1ForFork0InUse, 275#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1799#true, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true]) [2023-12-09 15:22:55,906 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L60-->L73-1: Formula: (and (= v_~manager_state~0_28 2) (= (+ v_~node_back~0_43 1) v_~node_back~0_42) (not (= (ite (and (< v_~node_back~0_43 v_~node_size~0_20) (<= 0 v_~node_back~0_43)) 1 0) 0)) (not (= (ite (= v_~update~0_43 (select (select |v_#memory_int_120| v_~node~0.base_27) (+ (* v_~node_back~0_43 4) v_~node~0.offset_27))) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_43, ~node_size~0=v_~node_size~0_20, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, ~update~0=v_~update~0_43} OutVars{~node_back~0=v_~node_back~0_42, ~manager_state~0=v_~manager_state~0_28, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~node_size~0=v_~node_size~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_43} AuxVars[] AssignedVars[~node_back~0, ~manager_state~0, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1829], [3630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~node_front~0 ~node_back~0)), 1793#(<= ~client_back~0 ~client_front~0), 170#L73-1true, 1789#(= ~node_state~0 0), 3240#true, 299#true, 316#true, 1795#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 1799#true, 297#(= ~client_state~0 0), 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true, 178#L89true]) [2023-12-09 15:22:55,907 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-12-09 15:22:55,907 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2023-12-09 15:22:57,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][1723], [3630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~node_front~0 ~node_back~0)), 1793#(<= ~client_back~0 ~client_front~0), 1789#(= ~node_state~0 0), 299#true, 3240#true, 20#L117-1true, 316#true, 1797#(= ~manager_state~0 1), thread3Thread1of1ForFork0InUse, 133#L60true, 275#true, thread1Thread1of1ForFork1InUse, 295#true, thread2Thread1of1ForFork2InUse, 1799#true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 221#L156-4true, 272#true, 287#true, 178#L89true]) [2023-12-09 15:22:57,015 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is not cut-off event [2023-12-09 15:22:57,015 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is not cut-off event [2023-12-09 15:22:57,015 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2023-12-09 15:22:57,015 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is not cut-off event [2023-12-09 15:22:59,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L89-->L95-1: Formula: (and (not (= (ite (and (< v_~node_front~0_31 v_~node_back~0_48) (< v_~node_front~0_31 v_~node_size~0_24) (<= 0 v_~node_front~0_31)) 1 0) 0)) (= v_~node_state~0_18 1) (= (+ 1 v_~node_front~0_31) v_~node_front~0_30) (= (ite (= (ite (= v_~update~0_45 (select (select |v_#memory_int_122| v_~node~0.base_29) (+ (* 4 v_~node_front~0_31) v_~node~0.offset_29))) 1 0) 0) 0 1) v_~safe~0_58)) InVars {~node_back~0=v_~node_back~0_48, ~node_size~0=v_~node_size~0_24, ~node~0.base=v_~node~0.base_29, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_31, ~node~0.offset=v_~node~0.offset_29, ~update~0=v_~update~0_45} OutVars{~node_back~0=v_~node_back~0_48, thread2Thread1of1ForFork2_#t~mem11#1=|v_thread2Thread1of1ForFork2_#t~mem11#1_1|, ~node~0.base=v_~node~0.base_29, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_#t~post12#1=|v_thread2Thread1of1ForFork2_#t~post12#1_1|, ~node~0.offset=v_~node~0.offset_29, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~node_size~0=v_~node_size~0_24, ~safe~0=v_~safe~0_58, #memory_int=|v_#memory_int_122|, ~node_front~0=v_~node_front~0_30, ~node_state~0=v_~node_state~0_18, ~update~0=v_~update~0_45} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem11#1, ~safe~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~post12#1, ~node_front~0, ~node_state~0][1722], [75#L95-1true, 3630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~node_front~0 ~node_back~0)), 1793#(<= ~client_back~0 ~client_front~0), 1787#true, 299#true, 3240#true, 316#true, 1797#(= ~manager_state~0 1), 133#L60true, thread3Thread1of1ForFork0InUse, 275#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1799#true, 297#(= ~client_state~0 0), 15#L157-1true, 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true]) [2023-12-09 15:22:59,536 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1018] L60-->L73-1: Formula: (and (= v_~manager_state~0_28 2) (= (+ v_~node_back~0_43 1) v_~node_back~0_42) (not (= (ite (and (< v_~node_back~0_43 v_~node_size~0_20) (<= 0 v_~node_back~0_43)) 1 0) 0)) (not (= (ite (= v_~update~0_43 (select (select |v_#memory_int_120| v_~node~0.base_27) (+ (* v_~node_back~0_43 4) v_~node~0.offset_27))) 1 0) 0))) InVars {~node_back~0=v_~node_back~0_43, ~node_size~0=v_~node_size~0_20, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, ~update~0=v_~update~0_43} OutVars{~node_back~0=v_~node_back~0_42, ~manager_state~0=v_~manager_state~0_28, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_1|, ~node_size~0=v_~node_size~0_20, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_1|, ~node~0.base=v_~node~0.base_27, #memory_int=|v_#memory_int_120|, ~node~0.offset=v_~node~0.offset_27, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, ~update~0=v_~update~0_43} AuxVars[] AssignedVars[~node_back~0, ~manager_state~0, thread1Thread1of1ForFork1_#t~mem4#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~post5#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1829], [3630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~node_front~0 ~node_back~0)), 1793#(<= ~client_back~0 ~client_front~0), 1789#(= ~node_state~0 0), 170#L73-1true, 3240#true, 299#true, 316#true, 1795#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1InUse, 275#true, thread2Thread1of1ForFork2InUse, 1799#true, 297#(= ~client_state~0 0), 15#L157-1true, 194#L111true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 287#true, 178#L89true]) [2023-12-09 15:22:59,536 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-12-09 15:22:59,536 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-12-09 15:23:01,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1049] L111-->L117-1: Formula: (and (= (+ v_~manager_back~0_98 1) v_~manager_back~0_97) (not (= (ite (= (select (select |v_#memory_int_130| v_~manager~0.base_65) (+ (* v_~manager_back~0_98 4) v_~manager~0.offset_65)) v_~update~0_51) 1 0) 0)) (= v_~client_state~0_20 1) (not (= (ite (and (<= 0 v_~manager_back~0_98) (< v_~manager_back~0_98 v_~manager_size~0_32)) 1 0) 0))) InVars {~manager~0.offset=v_~manager~0.offset_65, ~manager~0.base=v_~manager~0.base_65, #memory_int=|v_#memory_int_130|, ~manager_back~0=v_~manager_back~0_98, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_65, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_65, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_130|, ~client_state~0=v_~client_state~0_20, ~manager_back~0=v_~manager_back~0_97, ~manager_size~0=v_~manager_size~0_32, ~update~0=v_~update~0_51} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][1723], [3630#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~node_front~0 ~node_back~0)), 1793#(<= ~client_back~0 ~client_front~0), 1789#(= ~node_state~0 0), 299#true, 20#L117-1true, 3240#true, 316#true, 1797#(= ~manager_state~0 1), thread3Thread1of1ForFork0InUse, 133#L60true, 275#true, thread1Thread1of1ForFork1InUse, 295#true, thread2Thread1of1ForFork2InUse, 1799#true, 15#L157-1true, 291#true, 1757#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~manager_front~0 ~manager_back~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), 272#true, 178#L89true, 287#true]) [2023-12-09 15:23:01,269 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2023-12-09 15:23:01,269 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is not cut-off event [2023-12-09 15:23:01,269 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2023-12-09 15:23:01,269 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event