/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:44:25,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:44:25,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 11:44:25,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:44:25,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:44:25,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:44:25,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:44:25,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:44:25,529 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:44:25,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:44:25,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:44:25,530 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:44:25,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:44:25,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:44:25,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:44:25,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:44:25,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:44:25,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:44:25,532 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:44:25,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:44:25,533 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:44:25,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:44:25,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:44:25,534 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:44:25,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:44:25,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:44:25,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:44:25,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:44:25,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:44:25,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:44:25,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:44:25,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:44:25,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:44:25,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 11:44:25,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:44:25,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:44:25,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:44:25,739 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:44:25,741 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:44:25,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:44:26,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:44:27,173 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:44:27,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:44:27,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f733d87/2744177d60aa4985b87a309df2f745ff/FLAG4245dd732 [2023-11-10 11:44:27,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f733d87/2744177d60aa4985b87a309df2f745ff [2023-11-10 11:44:27,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:44:27,211 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:44:27,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:44:27,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:44:27,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:44:27,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5a8caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27, skipping insertion in model container [2023-11-10 11:44:27,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,269 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:44:27,395 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-10 11:44:27,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:44:27,617 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:44:27,638 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-10 11:44:27,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:44:27,718 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:44:27,718 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:44:27,725 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:44:27,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27 WrapperNode [2023-11-10 11:44:27,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:44:27,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:44:27,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:44:27,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:44:27,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,781 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-11-10 11:44:27,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:44:27,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:44:27,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:44:27,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:44:27,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:44:27,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:44:27,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:44:27,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:44:27,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (1/1) ... [2023-11-10 11:44:27,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:44:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:44:27,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 11:44:27,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 11:44:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:44:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:44:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:44:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:44:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:44:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:44:27,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:44:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:44:27,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:44:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:44:27,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:44:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-10 11:44:27,902 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-10 11:44:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:44:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:44:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:44:27,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:44:27,904 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:44:28,023 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:44:28,025 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:44:28,355 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:44:28,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:44:28,487 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:44:28,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:28 BoogieIcfgContainer [2023-11-10 11:44:28,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:44:28,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:44:28,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:44:28,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:44:28,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:44:27" (1/3) ... [2023-11-10 11:44:28,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52155df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:44:28, skipping insertion in model container [2023-11-10 11:44:28,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:44:27" (2/3) ... [2023-11-10 11:44:28,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52155df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:44:28, skipping insertion in model container [2023-11-10 11:44:28,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:44:28" (3/3) ... [2023-11-10 11:44:28,500 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:44:28,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:44:28,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:44:28,517 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:44:28,582 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:44:28,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 132 transitions, 280 flow [2023-11-10 11:44:28,682 INFO L124 PetriNetUnfolderBase]: 3/128 cut-off events. [2023-11-10 11:44:28,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:44:28,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 3/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-10 11:44:28,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 132 transitions, 280 flow [2023-11-10 11:44:28,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 128 transitions, 268 flow [2023-11-10 11:44:28,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:44:28,710 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f2da8e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:44:28,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-10 11:44:28,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:44:28,723 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-10 11:44:28,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:44:28,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:28,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:28,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:28,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:28,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1365567503, now seen corresponding path program 1 times [2023-11-10 11:44:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174011988] [2023-11-10 11:44:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:29,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174011988] [2023-11-10 11:44:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174011988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:44:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198342606] [2023-11-10 11:44:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:29,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:44:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:29,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:44:29,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:44:29,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 132 [2023-11-10 11:44:29,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:29,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:29,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 132 [2023-11-10 11:44:29,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:29,585 INFO L124 PetriNetUnfolderBase]: 162/541 cut-off events. [2023-11-10 11:44:29,585 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-10 11:44:29,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 541 events. 162/541 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2860 event pairs, 34 based on Foata normal form. 54/564 useless extension candidates. Maximal degree in co-relation 795. Up to 191 conditions per place. [2023-11-10 11:44:29,597 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 18 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-11-10 11:44:29,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 323 flow [2023-11-10 11:44:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:44:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:44:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-10 11:44:29,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9368686868686869 [2023-11-10 11:44:29,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-10 11:44:29,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-10 11:44:29,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:29,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-10 11:44:29,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:29,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:29,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:29,635 INFO L175 Difference]: Start difference. First operand has 138 places, 128 transitions, 268 flow. Second operand 3 states and 371 transitions. [2023-11-10 11:44:29,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 323 flow [2023-11-10 11:44:29,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 316 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 11:44:29,642 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 258 flow [2023-11-10 11:44:29,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2023-11-10 11:44:29,648 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, -4 predicate places. [2023-11-10 11:44:29,648 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 258 flow [2023-11-10 11:44:29,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:29,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:29,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:29,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:44:29,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:29,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1665813881, now seen corresponding path program 1 times [2023-11-10 11:44:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153796485] [2023-11-10 11:44:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153796485] [2023-11-10 11:44:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153796485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:44:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332786355] [2023-11-10 11:44:30,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:30,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:44:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:44:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:44:30,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 132 [2023-11-10 11:44:30,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:30,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:30,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 132 [2023-11-10 11:44:30,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:34,626 INFO L124 PetriNetUnfolderBase]: 14543/28054 cut-off events. [2023-11-10 11:44:34,627 INFO L125 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2023-11-10 11:44:34,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49393 conditions, 28054 events. 14543/28054 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 258887 event pairs, 2404 based on Foata normal form. 0/27397 useless extension candidates. Maximal degree in co-relation 49339. Up to 6544 conditions per place. [2023-11-10 11:44:34,822 INFO L140 encePairwiseOnDemand]: 119/132 looper letters, 47 selfloop transitions, 9 changer transitions 128/266 dead transitions. [2023-11-10 11:44:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 266 transitions, 920 flow [2023-11-10 11:44:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:44:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:44:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1449 transitions. [2023-11-10 11:44:34,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8444055944055944 [2023-11-10 11:44:34,829 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1449 transitions. [2023-11-10 11:44:34,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1449 transitions. [2023-11-10 11:44:34,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:34,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1449 transitions. [2023-11-10 11:44:34,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.46153846153847) internal successors, (1449), 13 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:34,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:34,840 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:34,841 INFO L175 Difference]: Start difference. First operand has 134 places, 123 transitions, 258 flow. Second operand 13 states and 1449 transitions. [2023-11-10 11:44:34,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 266 transitions, 920 flow [2023-11-10 11:44:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 266 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:44:34,849 INFO L231 Difference]: Finished difference. Result has 156 places, 116 transitions, 334 flow [2023-11-10 11:44:34,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=334, PETRI_PLACES=156, PETRI_TRANSITIONS=116} [2023-11-10 11:44:34,850 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 18 predicate places. [2023-11-10 11:44:34,851 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 116 transitions, 334 flow [2023-11-10 11:44:34,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:34,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:34,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:34,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:44:34,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:34,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash 490925512, now seen corresponding path program 1 times [2023-11-10 11:44:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834686638] [2023-11-10 11:44:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:35,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834686638] [2023-11-10 11:44:35,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834686638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:35,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:35,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:44:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283992395] [2023-11-10 11:44:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:35,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:44:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:44:35,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:44:35,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 132 [2023-11-10 11:44:35,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 116 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:35,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:35,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 132 [2023-11-10 11:44:35,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:37,309 INFO L124 PetriNetUnfolderBase]: 6314/11301 cut-off events. [2023-11-10 11:44:37,310 INFO L125 PetriNetUnfolderBase]: For 17974/18188 co-relation queries the response was YES. [2023-11-10 11:44:37,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32259 conditions, 11301 events. 6314/11301 cut-off events. For 17974/18188 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 90976 event pairs, 2166 based on Foata normal form. 252/11234 useless extension candidates. Maximal degree in co-relation 32196. Up to 5588 conditions per place. [2023-11-10 11:44:37,421 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 27 selfloop transitions, 5 changer transitions 61/186 dead transitions. [2023-11-10 11:44:37,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 186 transitions, 894 flow [2023-11-10 11:44:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:44:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:44:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1011 transitions. [2023-11-10 11:44:37,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.851010101010101 [2023-11-10 11:44:37,425 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1011 transitions. [2023-11-10 11:44:37,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1011 transitions. [2023-11-10 11:44:37,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:37,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1011 transitions. [2023-11-10 11:44:37,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:37,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:37,432 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:37,432 INFO L175 Difference]: Start difference. First operand has 156 places, 116 transitions, 334 flow. Second operand 9 states and 1011 transitions. [2023-11-10 11:44:37,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 186 transitions, 894 flow [2023-11-10 11:44:37,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 186 transitions, 880 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-10 11:44:37,483 INFO L231 Difference]: Finished difference. Result has 144 places, 120 transitions, 421 flow [2023-11-10 11:44:37,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=421, PETRI_PLACES=144, PETRI_TRANSITIONS=120} [2023-11-10 11:44:37,485 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 6 predicate places. [2023-11-10 11:44:37,485 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 120 transitions, 421 flow [2023-11-10 11:44:37,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:37,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:37,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:37,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:44:37,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:37,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash 42335753, now seen corresponding path program 1 times [2023-11-10 11:44:37,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:37,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96087816] [2023-11-10 11:44:37,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96087816] [2023-11-10 11:44:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96087816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:37,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:44:37,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785654065] [2023-11-10 11:44:37,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:37,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:44:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:44:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:44:37,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 132 [2023-11-10 11:44:37,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 120 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:37,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:37,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 132 [2023-11-10 11:44:37,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:41,777 INFO L124 PetriNetUnfolderBase]: 19626/32821 cut-off events. [2023-11-10 11:44:41,778 INFO L125 PetriNetUnfolderBase]: For 31646/41014 co-relation queries the response was YES. [2023-11-10 11:44:41,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77098 conditions, 32821 events. 19626/32821 cut-off events. For 31646/41014 co-relation queries the response was YES. Maximal size of possible extension queue 2140. Compared 286979 event pairs, 1432 based on Foata normal form. 175/31311 useless extension candidates. Maximal degree in co-relation 77029. Up to 12162 conditions per place. [2023-11-10 11:44:42,123 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 95 selfloop transitions, 20 changer transitions 0/209 dead transitions. [2023-11-10 11:44:42,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 209 transitions, 919 flow [2023-11-10 11:44:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:44:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:44:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1129 transitions. [2023-11-10 11:44:42,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8553030303030303 [2023-11-10 11:44:42,127 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1129 transitions. [2023-11-10 11:44:42,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1129 transitions. [2023-11-10 11:44:42,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:42,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1129 transitions. [2023-11-10 11:44:42,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.9) internal successors, (1129), 10 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:42,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:42,133 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:42,133 INFO L175 Difference]: Start difference. First operand has 144 places, 120 transitions, 421 flow. Second operand 10 states and 1129 transitions. [2023-11-10 11:44:42,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 209 transitions, 919 flow [2023-11-10 11:44:42,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 209 transitions, 902 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-10 11:44:42,169 INFO L231 Difference]: Finished difference. Result has 149 places, 138 transitions, 547 flow [2023-11-10 11:44:42,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=547, PETRI_PLACES=149, PETRI_TRANSITIONS=138} [2023-11-10 11:44:42,170 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 11 predicate places. [2023-11-10 11:44:42,170 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 138 transitions, 547 flow [2023-11-10 11:44:42,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:42,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:42,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:42,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:44:42,171 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:42,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -152637659, now seen corresponding path program 1 times [2023-11-10 11:44:42,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:42,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56344770] [2023-11-10 11:44:42,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:42,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56344770] [2023-11-10 11:44:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56344770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:42,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:44:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599627479] [2023-11-10 11:44:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:42,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:44:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:44:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:44:42,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 132 [2023-11-10 11:44:42,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 138 transitions, 547 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:42,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:42,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 132 [2023-11-10 11:44:42,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:45,912 INFO L124 PetriNetUnfolderBase]: 9332/22261 cut-off events. [2023-11-10 11:44:45,912 INFO L125 PetriNetUnfolderBase]: For 46705/50161 co-relation queries the response was YES. [2023-11-10 11:44:46,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66999 conditions, 22261 events. 9332/22261 cut-off events. For 46705/50161 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 250774 event pairs, 2100 based on Foata normal form. 500/21482 useless extension candidates. Maximal degree in co-relation 66922. Up to 3722 conditions per place. [2023-11-10 11:44:46,194 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 124 selfloop transitions, 39 changer transitions 0/263 dead transitions. [2023-11-10 11:44:46,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 263 transitions, 1635 flow [2023-11-10 11:44:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:44:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:44:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1414 transitions. [2023-11-10 11:44:46,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.824009324009324 [2023-11-10 11:44:46,206 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1414 transitions. [2023-11-10 11:44:46,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1414 transitions. [2023-11-10 11:44:46,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:46,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1414 transitions. [2023-11-10 11:44:46,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.76923076923077) internal successors, (1414), 13 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:46,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:46,213 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:46,213 INFO L175 Difference]: Start difference. First operand has 149 places, 138 transitions, 547 flow. Second operand 13 states and 1414 transitions. [2023-11-10 11:44:46,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 263 transitions, 1635 flow [2023-11-10 11:44:46,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 263 transitions, 1591 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-11-10 11:44:46,518 INFO L231 Difference]: Finished difference. Result has 169 places, 171 transitions, 1011 flow [2023-11-10 11:44:46,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1011, PETRI_PLACES=169, PETRI_TRANSITIONS=171} [2023-11-10 11:44:46,521 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 31 predicate places. [2023-11-10 11:44:46,521 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 171 transitions, 1011 flow [2023-11-10 11:44:46,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:46,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:46,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:46,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:44:46,522 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:46,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1086405146, now seen corresponding path program 1 times [2023-11-10 11:44:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874823789] [2023-11-10 11:44:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874823789] [2023-11-10 11:44:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874823789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:46,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:44:46,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550242644] [2023-11-10 11:44:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:46,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:44:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:44:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:44:46,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 132 [2023-11-10 11:44:46,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 171 transitions, 1011 flow. Second operand has 7 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:46,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:46,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 132 [2023-11-10 11:44:46,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:53,411 INFO L124 PetriNetUnfolderBase]: 26581/46160 cut-off events. [2023-11-10 11:44:53,412 INFO L125 PetriNetUnfolderBase]: For 129631/142866 co-relation queries the response was YES. [2023-11-10 11:44:53,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151718 conditions, 46160 events. 26581/46160 cut-off events. For 129631/142866 co-relation queries the response was YES. Maximal size of possible extension queue 2881. Compared 438227 event pairs, 1448 based on Foata normal form. 2086/46862 useless extension candidates. Maximal degree in co-relation 151634. Up to 9820 conditions per place. [2023-11-10 11:44:53,962 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 138 selfloop transitions, 38 changer transitions 2/300 dead transitions. [2023-11-10 11:44:53,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 300 transitions, 2167 flow [2023-11-10 11:44:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:44:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:44:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1472 transitions. [2023-11-10 11:44:53,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8578088578088578 [2023-11-10 11:44:53,967 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1472 transitions. [2023-11-10 11:44:53,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1472 transitions. [2023-11-10 11:44:53,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:53,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1472 transitions. [2023-11-10 11:44:53,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.23076923076923) internal successors, (1472), 13 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:53,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:53,974 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:53,974 INFO L175 Difference]: Start difference. First operand has 169 places, 171 transitions, 1011 flow. Second operand 13 states and 1472 transitions. [2023-11-10 11:44:53,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 300 transitions, 2167 flow [2023-11-10 11:44:55,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 300 transitions, 2129 flow, removed 19 selfloop flow, removed 0 redundant places. [2023-11-10 11:44:55,327 INFO L231 Difference]: Finished difference. Result has 187 places, 188 transitions, 1236 flow [2023-11-10 11:44:55,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1236, PETRI_PLACES=187, PETRI_TRANSITIONS=188} [2023-11-10 11:44:55,328 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 49 predicate places. [2023-11-10 11:44:55,328 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 188 transitions, 1236 flow [2023-11-10 11:44:55,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:55,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:55,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:55,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:44:55,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:55,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1895168083, now seen corresponding path program 1 times [2023-11-10 11:44:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526332962] [2023-11-10 11:44:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:44:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526332962] [2023-11-10 11:44:55,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526332962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:55,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:55,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:44:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933870138] [2023-11-10 11:44:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:55,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:44:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:44:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:44:55,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 132 [2023-11-10 11:44:55,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 188 transitions, 1236 flow. Second operand has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:44:55,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:55,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 132 [2023-11-10 11:44:55,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:45:01,995 INFO L124 PetriNetUnfolderBase]: 24782/43557 cut-off events. [2023-11-10 11:45:01,995 INFO L125 PetriNetUnfolderBase]: For 184826/197654 co-relation queries the response was YES. [2023-11-10 11:45:02,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169285 conditions, 43557 events. 24782/43557 cut-off events. For 184826/197654 co-relation queries the response was YES. Maximal size of possible extension queue 2862. Compared 421082 event pairs, 1259 based on Foata normal form. 1584/43807 useless extension candidates. Maximal degree in co-relation 169192. Up to 9189 conditions per place. [2023-11-10 11:45:03,066 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 136 selfloop transitions, 58 changer transitions 43/340 dead transitions. [2023-11-10 11:45:03,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 340 transitions, 2790 flow [2023-11-10 11:45:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:45:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:45:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1814 transitions. [2023-11-10 11:45:03,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8589015151515151 [2023-11-10 11:45:03,072 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1814 transitions. [2023-11-10 11:45:03,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1814 transitions. [2023-11-10 11:45:03,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:45:03,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1814 transitions. [2023-11-10 11:45:03,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 113.375) internal successors, (1814), 16 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:03,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:03,081 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:03,081 INFO L175 Difference]: Start difference. First operand has 187 places, 188 transitions, 1236 flow. Second operand 16 states and 1814 transitions. [2023-11-10 11:45:03,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 340 transitions, 2790 flow [2023-11-10 11:45:11,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 340 transitions, 2674 flow, removed 46 selfloop flow, removed 5 redundant places. [2023-11-10 11:45:11,455 INFO L231 Difference]: Finished difference. Result has 198 places, 195 transitions, 1417 flow [2023-11-10 11:45:11,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1417, PETRI_PLACES=198, PETRI_TRANSITIONS=195} [2023-11-10 11:45:11,456 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 60 predicate places. [2023-11-10 11:45:11,456 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 195 transitions, 1417 flow [2023-11-10 11:45:11,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:11,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:45:11,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:45:11,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:45:11,457 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:45:11,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:45:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1599338001, now seen corresponding path program 1 times [2023-11-10 11:45:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:45:11,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291516286] [2023-11-10 11:45:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:45:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:45:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:45:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:45:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:45:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291516286] [2023-11-10 11:45:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291516286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:45:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:45:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:45:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766333431] [2023-11-10 11:45:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:45:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:45:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:45:11,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:45:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:45:11,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 132 [2023-11-10 11:45:11,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 195 transitions, 1417 flow. Second operand has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:11,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:45:11,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 132 [2023-11-10 11:45:11,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:45:14,371 INFO L124 PetriNetUnfolderBase]: 6706/20349 cut-off events. [2023-11-10 11:45:14,371 INFO L125 PetriNetUnfolderBase]: For 96685/102201 co-relation queries the response was YES. [2023-11-10 11:45:14,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78866 conditions, 20349 events. 6706/20349 cut-off events. For 96685/102201 co-relation queries the response was YES. Maximal size of possible extension queue 2786. Compared 281876 event pairs, 254 based on Foata normal form. 23/19187 useless extension candidates. Maximal degree in co-relation 78766. Up to 4424 conditions per place. [2023-11-10 11:45:14,763 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 63 selfloop transitions, 20 changer transitions 40/269 dead transitions. [2023-11-10 11:45:14,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 269 transitions, 2155 flow [2023-11-10 11:45:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:45:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:45:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1082 transitions. [2023-11-10 11:45:14,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8196969696969697 [2023-11-10 11:45:14,766 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1082 transitions. [2023-11-10 11:45:14,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1082 transitions. [2023-11-10 11:45:14,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:45:14,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1082 transitions. [2023-11-10 11:45:14,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.2) internal successors, (1082), 10 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:14,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:14,772 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:14,772 INFO L175 Difference]: Start difference. First operand has 198 places, 195 transitions, 1417 flow. Second operand 10 states and 1082 transitions. [2023-11-10 11:45:14,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 269 transitions, 2155 flow [2023-11-10 11:45:20,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 269 transitions, 1746 flow, removed 162 selfloop flow, removed 20 redundant places. [2023-11-10 11:45:20,664 INFO L231 Difference]: Finished difference. Result has 190 places, 201 transitions, 1226 flow [2023-11-10 11:45:20,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1226, PETRI_PLACES=190, PETRI_TRANSITIONS=201} [2023-11-10 11:45:20,665 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 52 predicate places. [2023-11-10 11:45:20,665 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 201 transitions, 1226 flow [2023-11-10 11:45:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:20,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:45:20,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:45:20,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:45:20,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:45:20,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:45:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash -297327220, now seen corresponding path program 1 times [2023-11-10 11:45:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:45:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656527990] [2023-11-10 11:45:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:45:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:45:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:45:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:45:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:45:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656527990] [2023-11-10 11:45:21,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656527990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:45:21,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:45:21,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 11:45:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210389895] [2023-11-10 11:45:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:45:21,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 11:45:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:45:21,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 11:45:21,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-10 11:45:21,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 132 [2023-11-10 11:45:21,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 201 transitions, 1226 flow. Second operand has 12 states, 12 states have (on average 93.58333333333333) internal successors, (1123), 12 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:21,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:45:21,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 132 [2023-11-10 11:45:21,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:45:27,083 INFO L124 PetriNetUnfolderBase]: 13036/39566 cut-off events. [2023-11-10 11:45:27,084 INFO L125 PetriNetUnfolderBase]: For 72865/74141 co-relation queries the response was YES. [2023-11-10 11:45:27,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111869 conditions, 39566 events. 13036/39566 cut-off events. For 72865/74141 co-relation queries the response was YES. Maximal size of possible extension queue 5186. Compared 600296 event pairs, 195 based on Foata normal form. 56/37395 useless extension candidates. Maximal degree in co-relation 111766. Up to 3826 conditions per place. [2023-11-10 11:45:27,697 INFO L140 encePairwiseOnDemand]: 113/132 looper letters, 119 selfloop transitions, 81 changer transitions 31/370 dead transitions. [2023-11-10 11:45:27,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 370 transitions, 3208 flow [2023-11-10 11:45:27,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-10 11:45:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-10 11:45:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1718 transitions. [2023-11-10 11:45:27,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7655971479500892 [2023-11-10 11:45:27,701 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1718 transitions. [2023-11-10 11:45:27,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1718 transitions. [2023-11-10 11:45:27,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:45:27,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1718 transitions. [2023-11-10 11:45:27,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 101.05882352941177) internal successors, (1718), 17 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:27,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 132.0) internal successors, (2376), 18 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:27,710 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 132.0) internal successors, (2376), 18 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:27,710 INFO L175 Difference]: Start difference. First operand has 190 places, 201 transitions, 1226 flow. Second operand 17 states and 1718 transitions. [2023-11-10 11:45:27,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 370 transitions, 3208 flow [2023-11-10 11:45:35,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 370 transitions, 3006 flow, removed 101 selfloop flow, removed 6 redundant places. [2023-11-10 11:45:35,287 INFO L231 Difference]: Finished difference. Result has 204 places, 257 transitions, 2173 flow [2023-11-10 11:45:35,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2173, PETRI_PLACES=204, PETRI_TRANSITIONS=257} [2023-11-10 11:45:35,288 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 66 predicate places. [2023-11-10 11:45:35,288 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 257 transitions, 2173 flow [2023-11-10 11:45:35,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.58333333333333) internal successors, (1123), 12 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:35,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:45:35,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:45:35,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:45:35,289 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:45:35,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:45:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash -994590212, now seen corresponding path program 2 times [2023-11-10 11:45:35,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:45:35,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243457901] [2023-11-10 11:45:35,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:45:35,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:45:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:45:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:45:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:45:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243457901] [2023-11-10 11:45:35,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243457901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:45:35,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:45:35,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:45:35,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902832983] [2023-11-10 11:45:35,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:45:35,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:45:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:45:35,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:45:35,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:45:35,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 132 [2023-11-10 11:45:35,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 257 transitions, 2173 flow. Second operand has 9 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:35,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:45:35,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 132 [2023-11-10 11:45:35,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:45:46,074 INFO L124 PetriNetUnfolderBase]: 22417/68604 cut-off events. [2023-11-10 11:45:46,074 INFO L125 PetriNetUnfolderBase]: For 113097/115725 co-relation queries the response was YES. [2023-11-10 11:45:46,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193331 conditions, 68604 events. 22417/68604 cut-off events. For 113097/115725 co-relation queries the response was YES. Maximal size of possible extension queue 9147. Compared 1131017 event pairs, 393 based on Foata normal form. 88/64655 useless extension candidates. Maximal degree in co-relation 193223. Up to 7552 conditions per place. [2023-11-10 11:45:47,074 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 72 selfloop transitions, 22 changer transitions 13/317 dead transitions. [2023-11-10 11:45:47,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 317 transitions, 2796 flow [2023-11-10 11:45:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:45:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:45:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1072 transitions. [2023-11-10 11:45:47,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8121212121212121 [2023-11-10 11:45:47,076 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1072 transitions. [2023-11-10 11:45:47,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1072 transitions. [2023-11-10 11:45:47,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:45:47,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1072 transitions. [2023-11-10 11:45:47,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.2) internal successors, (1072), 10 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:47,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:47,081 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:45:47,081 INFO L175 Difference]: Start difference. First operand has 204 places, 257 transitions, 2173 flow. Second operand 10 states and 1072 transitions. [2023-11-10 11:45:47,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 317 transitions, 2796 flow [2023-11-10 11:46:20,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 317 transitions, 2724 flow, removed 34 selfloop flow, removed 8 redundant places. [2023-11-10 11:46:20,993 INFO L231 Difference]: Finished difference. Result has 205 places, 279 transitions, 2384 flow [2023-11-10 11:46:20,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=2133, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2384, PETRI_PLACES=205, PETRI_TRANSITIONS=279} [2023-11-10 11:46:20,994 INFO L281 CegarLoopForPetriNet]: 138 programPoint places, 67 predicate places. [2023-11-10 11:46:20,995 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 279 transitions, 2384 flow [2023-11-10 11:46:20,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:20,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:46:20,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:46:20,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:46:20,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:46:20,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:46:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1627367380, now seen corresponding path program 3 times [2023-11-10 11:46:20,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:46:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419325744] [2023-11-10 11:46:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:46:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:46:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:46:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:46:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:46:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419325744] [2023-11-10 11:46:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419325744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:46:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:46:21,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:46:21,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993027127] [2023-11-10 11:46:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:46:21,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:46:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:46:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:46:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:46:21,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 132 [2023-11-10 11:46:21,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 279 transitions, 2384 flow. Second operand has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:46:21,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:46:21,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 132 [2023-11-10 11:46:21,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:46:27,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][318], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 84#L870true, P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 12#L769true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 446#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 115#L809true, 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 313#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-10 11:46:27,592 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,592 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][383], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 84#L870true, P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 21#L835true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 446#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 149#true, 234#(= ~x~0 1), 71#L782true, 363#true, 115#L809true, 313#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-10 11:46:27,593 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,593 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,593 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:46:27,593 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-10 11:46:30,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][318], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 72#L2true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 12#L769true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 446#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 115#L809true, 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 313#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-10 11:46:30,405 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,405 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,405 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,405 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][383], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 21#L835true, 72#L2true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 446#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 149#true, 234#(= ~x~0 1), 71#L782true, 363#true, 115#L809true, 313#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))]) [2023-11-10 11:46:30,406 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,406 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,406 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,406 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][345], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 452#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 84#L870true, P3Thread1of1ForFork1InUse, 284#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 222#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), 62#L812true, Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 12#L769true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-10 11:46:30,407 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,407 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,407 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,407 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][428], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 452#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 84#L870true, P3Thread1of1ForFork1InUse, 284#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 21#L835true, 222#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 62#L812true, Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 149#true, 71#L782true, 363#true]) [2023-11-10 11:46:30,408 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,408 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,408 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:30,408 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-10 11:46:33,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][382], [60#L3true, Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 232#true, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 315#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 12#L769true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 448#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 115#L809true, 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-10 11:46:33,929 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][468], [60#L3true, Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 315#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 21#L835true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 448#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 149#true, 71#L782true, 363#true, 115#L809true]) [2023-11-10 11:46:33,930 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,930 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][345], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 452#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, 284#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 232#true, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 222#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), 62#L812true, Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 12#L769true, 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-10 11:46:33,932 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,932 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,932 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,932 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][428], [Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 452#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, 284#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 21#L835true, 222#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 62#L812true, Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 149#true, 363#true]) [2023-11-10 11:46:33,932 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,933 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,933 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:33,933 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-10 11:46:38,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][382], [130#L3-1true, Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 232#true, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 315#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 12#L769true, 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 448#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 115#L809true, 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-10 11:46:38,058 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][468], [130#L3-1true, Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 315#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 21#L835true, Black: 268#true, Black: 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), 448#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 149#true, 363#true, 115#L809true]) [2023-11-10 11:46:38,058 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,058 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L762-->L769: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_141 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_33 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_133 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_142 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= v_~a~0_78 (ite .cse0 v_~a$w_buff0~0_64 (ite .cse1 v_~a$w_buff1~0_45 v_~a~0_79))) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd1~0_32 256) 0))) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_132 256) 0)))) 0 v_~a$r_buff1_thd1~0_24) v_~a$r_buff1_thd1~0_23) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_133) v_~a$w_buff1_used~0_132) (= (ite .cse0 0 v_~a$w_buff0_used~0_142) v_~a$w_buff0_used~0_141) (= v_~a$r_buff0_thd1~0_32 (ite .cse4 0 v_~a$r_buff0_thd1~0_33))))) InVars {~a~0=v_~a~0_79, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_142, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_33, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133} OutVars{~a~0=v_~a~0_78, ~a$w_buff1~0=v_~a$w_buff1~0_45, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_141, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_32, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][424], [60#L3true, Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), Black: 268#true, Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 62#L812true, Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 149#true, Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 12#L769true, Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), 59#L819true, Black: 209#true, 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 234#(= ~x~0 1), 71#L782true, 454#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 371#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-10 11:46:38,059 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,059 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,060 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,060 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L819-->L835: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_72 256) 0)) (.cse2 (= (mod v_~a$r_buff0_thd4~0_78 256) 0))) (let ((.cse5 (not .cse2)) (.cse3 (and .cse9 .cse2)) (.cse11 (= (mod v_~a$w_buff0_used~0_158 256) 0)) (.cse8 (and (= (mod v_~a$w_buff1_used~0_149 256) 0) .cse2))) (let ((.cse6 (or .cse3 .cse11 .cse8)) (.cse7 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse1 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_157 256) 0))) (and (= v_~a$w_buff0~0_67 v_~a$w_buff0~0_66) (= v_~a~0_90 (ite .cse0 v_~a$mem_tmp~0_24 v_~__unbuffered_p3_EAX~0_10)) (= v_~a~0_92 v_~a$mem_tmp~0_24) (= v_~a$r_buff0_thd4~0_77 (ite .cse0 v_~a$r_buff0_thd4~0_78 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~a$r_buff0_thd4~0_78 (ite (and .cse5 (not .cse4)) 0 v_~a$r_buff0_thd4~0_78)))) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff1~0_60 v_~a$w_buff1~0_59) (= v_~__unbuffered_p3_EAX~0_10 (ite .cse6 v_~a~0_92 (ite .cse7 v_~a$w_buff0~0_67 v_~a$w_buff1~0_60))) (= v_~a$w_buff0_used~0_157 (ite .cse0 v_~a$w_buff0_used~0_158 (ite .cse6 v_~a$w_buff0_used~0_158 (ite .cse7 0 v_~a$w_buff0_used~0_158)))) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse3 .cse8 .cse4) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148) (= (ite .cse0 v_~a$r_buff1_thd4~0_72 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_77 256) 0))) (or (and .cse9 .cse10) (and .cse1 .cse10) .cse4)) v_~a$r_buff1_thd4~0_72 0)) v_~a$r_buff1_thd4~0_71))))) InVars {~a~0=v_~a~0_92, ~a$w_buff1~0=v_~a$w_buff1~0_60, ~a$w_buff0~0=v_~a$w_buff0~0_67, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_72, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_158, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_78} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_71, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_157, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_77, ~a~0=v_~a~0_90, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_59, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_66, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_34, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][503], [60#L3true, Black: 235#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), P0Thread1of1ForFork0InUse, Black: 369#(and (= ~a$w_buff1_used~0 0) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), P3Thread1of1ForFork1InUse, Black: 368#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 232#true, Black: 378#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd1~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd1~0 1)), P1Thread1of1ForFork2InUse, P2Thread1of1ForFork3InUse, Black: 380#(and (= ~a$w_buff1_used~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$w_buff0_used~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd2~0 0)), 21#L835true, Black: 268#true, Black: 290#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 408#(and (= ~a$r_buff1_thd4~0 0) (= ~a~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 272#(= ~main$tmp_guard0~0 0), Black: 418#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), 286#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 407#(and (= ~a$r_buff1_thd4~0 0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 62#L812true, Black: 420#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 416#(and (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 422#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~__unbuffered_p3_EAX~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 40#L762true, Black: 152#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 335#(= ~z~0 1), 406#(= ~a$r_buff0_thd4~0 0), Black: 323#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 298#true, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 303#(= ~main$tmp_guard0~0 0), Black: 327#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 192#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 187#(= ~z~0 0), Black: 220#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 336#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~z~0))), Black: 209#true, 224#(and (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 212#(= ~main$tmp_guard0~0 0), Black: 333#true, 149#true, 234#(= ~x~0 1), 71#L782true, 454#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 363#true]) [2023-11-10 11:46:38,060 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,060 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,060 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-10 11:46:38,060 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event