/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:44:47,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:44:48,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:44:48,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:44:48,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:44:48,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:44:48,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:44:48,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:44:48,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:44:48,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:44:48,118 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:44:48,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:44:48,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:44:48,120 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:44:48,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:44:48,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:44:48,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:44:48,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:44:48,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:44:48,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:44:48,121 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:44:48,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:44:48,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:44:48,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:44:48,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:44:48,123 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:44:48,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:44:48,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:44:48,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:44:48,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:44:48,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:44:48,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:44:48,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:44:48,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:44:48,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:44:48,126 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:44:48,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:44:48,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:44:48,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:44:48,460 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:44:48,461 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:44:48,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-08-27 03:44:49,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:44:49,884 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:44:49,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-08-27 03:44:49,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08a11172/a19e5d726a384dbe9062b80847d3abf4/FLAGe8793287c [2023-08-27 03:44:49,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08a11172/a19e5d726a384dbe9062b80847d3abf4 [2023-08-27 03:44:49,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:44:49,921 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:44:49,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:44:49,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:44:49,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:44:49,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:44:49" (1/1) ... [2023-08-27 03:44:49,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd3dd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:49, skipping insertion in model container [2023-08-27 03:44:49,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:44:49" (1/1) ... [2023-08-27 03:44:49,973 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:44:50,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:44:50,404 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:44:50,429 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:44:50,431 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:44:50,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:44:50,509 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:44:50,509 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:44:50,515 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:44:50,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50 WrapperNode [2023-08-27 03:44:50,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:44:50,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:44:50,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:44:50,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:44:50,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,596 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-08-27 03:44:50,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:44:50,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:44:50,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:44:50,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:44:50,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:44:50,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:44:50,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:44:50,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:44:50,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (1/1) ... [2023-08-27 03:44:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:44:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:44:50,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:44:50,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:44:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:44:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:44:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:44:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:44:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:44:50,720 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:44:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:44:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:44:50,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:44:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:44:50,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:44:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:44:50,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:44:50,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:44:50,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:44:50,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:44:50,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:44:50,724 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:44:50,905 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:44:50,907 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:44:51,177 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:44:51,336 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:44:51,337 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:44:51,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:44:51 BoogieIcfgContainer [2023-08-27 03:44:51,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:44:51,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:44:51,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:44:51,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:44:51,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:44:49" (1/3) ... [2023-08-27 03:44:51,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477f2e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:44:51, skipping insertion in model container [2023-08-27 03:44:51,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:44:50" (2/3) ... [2023-08-27 03:44:51,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477f2e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:44:51, skipping insertion in model container [2023-08-27 03:44:51,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:44:51" (3/3) ... [2023-08-27 03:44:51,346 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2023-08-27 03:44:51,359 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:44:51,359 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:44:51,359 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:44:51,411 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:44:51,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 03:44:51,515 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 03:44:51,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:44:51,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 03:44:51,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 03:44:51,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-27 03:44:51,533 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:44:51,546 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 03:44:51,550 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 03:44:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-27 03:44:51,574 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 03:44:51,574 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:44:51,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 03:44:51,578 INFO L119 LiptonReduction]: Number of co-enabled transitions 4342 [2023-08-27 03:44:56,240 INFO L134 LiptonReduction]: Checked pairs total: 16528 [2023-08-27 03:44:56,241 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-27 03:44:56,252 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:44:56,258 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@393a219e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:44:56,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:44:56,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:44:56,262 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 03:44:56,263 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:44:56,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:44:56,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:44:56,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:44:56,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:44:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 586075735, now seen corresponding path program 1 times [2023-08-27 03:44:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:44:56,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534132315] [2023-08-27 03:44:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:44:56,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:44:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:44:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:44:56,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:44:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534132315] [2023-08-27 03:44:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534132315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:44:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:44:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:44:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613880225] [2023-08-27 03:44:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:44:56,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:44:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:44:56,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:44:56,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:44:56,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:44:56,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:56,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:44:56,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:44:56,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:44:58,196 INFO L124 PetriNetUnfolderBase]: 9591/13074 cut-off events. [2023-08-27 03:44:58,196 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-08-27 03:44:58,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26250 conditions, 13074 events. 9591/13074 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 71820 event pairs, 9591 based on Foata normal form. 0/9059 useless extension candidates. Maximal degree in co-relation 26238. Up to 12880 conditions per place. [2023-08-27 03:44:58,315 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 27 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-27 03:44:58,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 33 transitions, 134 flow [2023-08-27 03:44:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:44:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:44:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-27 03:44:58,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697554697554698 [2023-08-27 03:44:58,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-27 03:44:58,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-27 03:44:58,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:44:58,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-27 03:44:58,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:58,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:58,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:58,342 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 3 states and 365 transitions. [2023-08-27 03:44:58,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 33 transitions, 134 flow [2023-08-27 03:44:58,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:44:58,349 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-27 03:44:58,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-27 03:44:58,353 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-27 03:44:58,354 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-27 03:44:58,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:58,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:44:58,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:44:58,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:44:58,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:44:58,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:44:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 586075736, now seen corresponding path program 1 times [2023-08-27 03:44:58,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:44:58,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196180267] [2023-08-27 03:44:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:44:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:44:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:44:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:44:58,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:44:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196180267] [2023-08-27 03:44:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196180267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:44:58,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:44:58,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:44:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381510303] [2023-08-27 03:44:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:44:58,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:44:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:44:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:44:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:44:58,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:44:58,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:58,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:44:58,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:44:58,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:44:59,426 INFO L124 PetriNetUnfolderBase]: 6157/8586 cut-off events. [2023-08-27 03:44:59,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:44:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17314 conditions, 8586 events. 6157/8586 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46549 event pairs, 1551 based on Foata normal form. 0/6425 useless extension candidates. Maximal degree in co-relation 17308. Up to 7129 conditions per place. [2023-08-27 03:44:59,489 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 45 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-27 03:44:59,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 226 flow [2023-08-27 03:44:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:44:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:44:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-27 03:44:59,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2023-08-27 03:44:59,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-27 03:44:59,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-27 03:44:59,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:44:59,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-27 03:44:59,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:59,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:59,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:59,502 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 387 transitions. [2023-08-27 03:44:59,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 226 flow [2023-08-27 03:44:59,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:44:59,505 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-27 03:44:59,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-27 03:44:59,508 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-27 03:44:59,509 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-27 03:44:59,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:59,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:44:59,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:44:59,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:44:59,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:44:59,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:44:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash 631181501, now seen corresponding path program 1 times [2023-08-27 03:44:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:44:59,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035090567] [2023-08-27 03:44:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:44:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:44:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:44:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:44:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:44:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035090567] [2023-08-27 03:44:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035090567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:44:59,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:44:59,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:44:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340521241] [2023-08-27 03:44:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:44:59,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:44:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:44:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:44:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:44:59,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 259 [2023-08-27 03:44:59,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:59,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:44:59,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 259 [2023-08-27 03:44:59,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:00,685 INFO L124 PetriNetUnfolderBase]: 5086/7299 cut-off events. [2023-08-27 03:45:00,686 INFO L125 PetriNetUnfolderBase]: For 533/533 co-relation queries the response was YES. [2023-08-27 03:45:00,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17748 conditions, 7299 events. 5086/7299 cut-off events. For 533/533 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 40661 event pairs, 1214 based on Foata normal form. 0/5754 useless extension candidates. Maximal degree in co-relation 17740. Up to 5923 conditions per place. [2023-08-27 03:45:00,741 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 49 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-27 03:45:00,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 277 flow [2023-08-27 03:45:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-27 03:45:00,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057915057915058 [2023-08-27 03:45:00,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-27 03:45:00,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-27 03:45:00,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:00,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-27 03:45:00,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:00,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:00,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:00,747 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 393 transitions. [2023-08-27 03:45:00,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 277 flow [2023-08-27 03:45:00,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:00,749 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2023-08-27 03:45:00,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-27 03:45:00,750 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-27 03:45:00,750 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2023-08-27 03:45:00,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:00,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:00,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:00,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:45:00,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:00,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -766501182, now seen corresponding path program 1 times [2023-08-27 03:45:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184904599] [2023-08-27 03:45:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184904599] [2023-08-27 03:45:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184904599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806510972] [2023-08-27 03:45:00,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:00,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:00,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:45:00,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:00,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:00,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:45:00,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:01,355 INFO L124 PetriNetUnfolderBase]: 3228/4590 cut-off events. [2023-08-27 03:45:01,355 INFO L125 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2023-08-27 03:45:01,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10993 conditions, 4590 events. 3228/4590 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23207 event pairs, 759 based on Foata normal form. 0/4040 useless extension candidates. Maximal degree in co-relation 10984. Up to 1850 conditions per place. [2023-08-27 03:45:01,381 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 58 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-08-27 03:45:01,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 339 flow [2023-08-27 03:45:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-27 03:45:01,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971042471042471 [2023-08-27 03:45:01,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-27 03:45:01,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-27 03:45:01,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:01,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-27 03:45:01,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:01,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:01,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:01,387 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 515 transitions. [2023-08-27 03:45:01,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 339 flow [2023-08-27 03:45:01,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:01,391 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 165 flow [2023-08-27 03:45:01,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-27 03:45:01,392 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-27 03:45:01,392 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 165 flow [2023-08-27 03:45:01,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:01,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:01,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:01,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:45:01,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:01,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 768938675, now seen corresponding path program 1 times [2023-08-27 03:45:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165463172] [2023-08-27 03:45:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165463172] [2023-08-27 03:45:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165463172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565409113] [2023-08-27 03:45:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:01,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:01,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:01,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2023-08-27 03:45:01,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:01,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:01,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2023-08-27 03:45:01,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:02,169 INFO L124 PetriNetUnfolderBase]: 4875/6977 cut-off events. [2023-08-27 03:45:02,169 INFO L125 PetriNetUnfolderBase]: For 5030/5030 co-relation queries the response was YES. [2023-08-27 03:45:02,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18376 conditions, 6977 events. 4875/6977 cut-off events. For 5030/5030 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 37021 event pairs, 1101 based on Foata normal form. 0/6367 useless extension candidates. Maximal degree in co-relation 18366. Up to 6288 conditions per place. [2023-08-27 03:45:02,209 INFO L140 encePairwiseOnDemand]: 255/259 looper letters, 49 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-27 03:45:02,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 321 flow [2023-08-27 03:45:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-27 03:45:02,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49163449163449163 [2023-08-27 03:45:02,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-27 03:45:02,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-27 03:45:02,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:02,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-27 03:45:02,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:02,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:02,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:02,214 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 165 flow. Second operand 3 states and 382 transitions. [2023-08-27 03:45:02,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 321 flow [2023-08-27 03:45:02,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 295 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:02,221 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 166 flow [2023-08-27 03:45:02,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-27 03:45:02,221 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 03:45:02,222 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 166 flow [2023-08-27 03:45:02,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:02,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:02,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:02,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:45:02,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:02,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:02,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1932706974, now seen corresponding path program 1 times [2023-08-27 03:45:02,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:02,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585774694] [2023-08-27 03:45:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585774694] [2023-08-27 03:45:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585774694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:02,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:02,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089277310] [2023-08-27 03:45:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:02,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:02,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:02,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 259 [2023-08-27 03:45:02,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:02,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:02,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 259 [2023-08-27 03:45:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:04,493 INFO L124 PetriNetUnfolderBase]: 15123/20811 cut-off events. [2023-08-27 03:45:04,493 INFO L125 PetriNetUnfolderBase]: For 9162/9162 co-relation queries the response was YES. [2023-08-27 03:45:04,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53343 conditions, 20811 events. 15123/20811 cut-off events. For 9162/9162 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 112173 event pairs, 1173 based on Foata normal form. 436/20622 useless extension candidates. Maximal degree in co-relation 53332. Up to 13662 conditions per place. [2023-08-27 03:45:04,610 INFO L140 encePairwiseOnDemand]: 245/259 looper letters, 87 selfloop transitions, 17 changer transitions 0/104 dead transitions. [2023-08-27 03:45:04,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 104 transitions, 596 flow [2023-08-27 03:45:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-27 03:45:04,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613899613899614 [2023-08-27 03:45:04,613 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-27 03:45:04,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-27 03:45:04,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:04,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-27 03:45:04,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:04,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:04,618 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:04,618 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 166 flow. Second operand 4 states and 478 transitions. [2023-08-27 03:45:04,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 104 transitions, 596 flow [2023-08-27 03:45:04,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 104 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:04,624 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 303 flow [2023-08-27 03:45:04,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2023-08-27 03:45:04,624 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-27 03:45:04,625 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 303 flow [2023-08-27 03:45:04,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:04,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:04,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:04,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:45:04,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:04,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 147094824, now seen corresponding path program 1 times [2023-08-27 03:45:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104117956] [2023-08-27 03:45:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104117956] [2023-08-27 03:45:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104117956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598343932] [2023-08-27 03:45:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:05,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:05,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:05,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 259 [2023-08-27 03:45:05,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:05,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:05,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 259 [2023-08-27 03:45:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:06,913 INFO L124 PetriNetUnfolderBase]: 14674/20196 cut-off events. [2023-08-27 03:45:06,914 INFO L125 PetriNetUnfolderBase]: For 20404/20404 co-relation queries the response was YES. [2023-08-27 03:45:06,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68761 conditions, 20196 events. 14674/20196 cut-off events. For 20404/20404 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 104634 event pairs, 2973 based on Foata normal form. 150/19733 useless extension candidates. Maximal degree in co-relation 68746. Up to 9822 conditions per place. [2023-08-27 03:45:07,034 INFO L140 encePairwiseOnDemand]: 246/259 looper letters, 97 selfloop transitions, 22 changer transitions 0/119 dead transitions. [2023-08-27 03:45:07,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 119 transitions, 845 flow [2023-08-27 03:45:07,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-27 03:45:07,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45077220077220076 [2023-08-27 03:45:07,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-27 03:45:07,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-27 03:45:07,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:07,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-27 03:45:07,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:07,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:07,040 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:07,040 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 303 flow. Second operand 4 states and 467 transitions. [2023-08-27 03:45:07,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 119 transitions, 845 flow [2023-08-27 03:45:07,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 119 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:45:07,051 INFO L231 Difference]: Finished difference. Result has 60 places, 75 transitions, 519 flow [2023-08-27 03:45:07,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=60, PETRI_TRANSITIONS=75} [2023-08-27 03:45:07,052 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-27 03:45:07,052 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 75 transitions, 519 flow [2023-08-27 03:45:07,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:07,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:07,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:07,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:45:07,053 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:07,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 878991102, now seen corresponding path program 1 times [2023-08-27 03:45:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717532589] [2023-08-27 03:45:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:07,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717532589] [2023-08-27 03:45:07,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717532589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:07,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:07,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045585199] [2023-08-27 03:45:07,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:07,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 259 [2023-08-27 03:45:07,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 75 transitions, 519 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:07,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:07,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 259 [2023-08-27 03:45:07,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:09,125 INFO L124 PetriNetUnfolderBase]: 12107/17308 cut-off events. [2023-08-27 03:45:09,125 INFO L125 PetriNetUnfolderBase]: For 36321/37110 co-relation queries the response was YES. [2023-08-27 03:45:09,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70176 conditions, 17308 events. 12107/17308 cut-off events. For 36321/37110 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 100615 event pairs, 2472 based on Foata normal form. 358/16610 useless extension candidates. Maximal degree in co-relation 70156. Up to 14085 conditions per place. [2023-08-27 03:45:09,241 INFO L140 encePairwiseOnDemand]: 255/259 looper letters, 84 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2023-08-27 03:45:09,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 895 flow [2023-08-27 03:45:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-27 03:45:09,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48133848133848134 [2023-08-27 03:45:09,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-27 03:45:09,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-27 03:45:09,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:09,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-27 03:45:09,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:09,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:09,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:09,248 INFO L175 Difference]: Start difference. First operand has 60 places, 75 transitions, 519 flow. Second operand 3 states and 374 transitions. [2023-08-27 03:45:09,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 895 flow [2023-08-27 03:45:09,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 892 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:09,269 INFO L231 Difference]: Finished difference. Result has 62 places, 79 transitions, 570 flow [2023-08-27 03:45:09,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2023-08-27 03:45:09,272 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-08-27 03:45:09,272 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 570 flow [2023-08-27 03:45:09,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:09,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:09,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:09,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:45:09,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:09,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1475506403, now seen corresponding path program 1 times [2023-08-27 03:45:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007190137] [2023-08-27 03:45:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:09,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007190137] [2023-08-27 03:45:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007190137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055526564] [2023-08-27 03:45:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:09,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:09,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 259 [2023-08-27 03:45:09,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 570 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:09,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:09,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 259 [2023-08-27 03:45:09,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:11,392 INFO L124 PetriNetUnfolderBase]: 12132/17404 cut-off events. [2023-08-27 03:45:11,393 INFO L125 PetriNetUnfolderBase]: For 39963/40645 co-relation queries the response was YES. [2023-08-27 03:45:11,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72999 conditions, 17404 events. 12132/17404 cut-off events. For 39963/40645 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 101035 event pairs, 1950 based on Foata normal form. 412/16913 useless extension candidates. Maximal degree in co-relation 72977. Up to 12511 conditions per place. [2023-08-27 03:45:11,510 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 102 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2023-08-27 03:45:11,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 141 transitions, 1218 flow [2023-08-27 03:45:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-27 03:45:11,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49131274131274133 [2023-08-27 03:45:11,513 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-27 03:45:11,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-27 03:45:11,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:11,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-27 03:45:11,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:11,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:11,517 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:11,517 INFO L175 Difference]: Start difference. First operand has 62 places, 79 transitions, 570 flow. Second operand 4 states and 509 transitions. [2023-08-27 03:45:11,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 141 transitions, 1218 flow [2023-08-27 03:45:11,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 141 transitions, 1212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:11,531 INFO L231 Difference]: Finished difference. Result has 66 places, 93 transitions, 787 flow [2023-08-27 03:45:11,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=787, PETRI_PLACES=66, PETRI_TRANSITIONS=93} [2023-08-27 03:45:11,532 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-27 03:45:11,532 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 93 transitions, 787 flow [2023-08-27 03:45:11,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:11,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:11,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:11,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:45:11,533 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:11,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1478971118, now seen corresponding path program 1 times [2023-08-27 03:45:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711507100] [2023-08-27 03:45:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711507100] [2023-08-27 03:45:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711507100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669115347] [2023-08-27 03:45:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:12,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:12,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:45:12,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 93 transitions, 787 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:12,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:45:12,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:13,636 INFO L124 PetriNetUnfolderBase]: 12384/17729 cut-off events. [2023-08-27 03:45:13,636 INFO L125 PetriNetUnfolderBase]: For 58132/59398 co-relation queries the response was YES. [2023-08-27 03:45:13,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81370 conditions, 17729 events. 12384/17729 cut-off events. For 58132/59398 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 103399 event pairs, 1566 based on Foata normal form. 830/17635 useless extension candidates. Maximal degree in co-relation 81345. Up to 12959 conditions per place. [2023-08-27 03:45:13,771 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 123 selfloop transitions, 14 changer transitions 0/153 dead transitions. [2023-08-27 03:45:13,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 153 transitions, 1485 flow [2023-08-27 03:45:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-08-27 03:45:13,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48359073359073357 [2023-08-27 03:45:13,773 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-08-27 03:45:13,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-08-27 03:45:13,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:13,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-08-27 03:45:13,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,776 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,776 INFO L175 Difference]: Start difference. First operand has 66 places, 93 transitions, 787 flow. Second operand 4 states and 501 transitions. [2023-08-27 03:45:13,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 153 transitions, 1485 flow [2023-08-27 03:45:13,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 153 transitions, 1468 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:13,792 INFO L231 Difference]: Finished difference. Result has 69 places, 101 transitions, 892 flow [2023-08-27 03:45:13,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=892, PETRI_PLACES=69, PETRI_TRANSITIONS=101} [2023-08-27 03:45:13,793 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-27 03:45:13,793 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 101 transitions, 892 flow [2023-08-27 03:45:13,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:13,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:13,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:45:13,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:13,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1398719191, now seen corresponding path program 1 times [2023-08-27 03:45:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789160551] [2023-08-27 03:45:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789160551] [2023-08-27 03:45:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789160551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:14,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:14,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256098097] [2023-08-27 03:45:14,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:14,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 259 [2023-08-27 03:45:14,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 101 transitions, 892 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:14,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 259 [2023-08-27 03:45:14,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:15,774 INFO L124 PetriNetUnfolderBase]: 13128/18766 cut-off events. [2023-08-27 03:45:15,774 INFO L125 PetriNetUnfolderBase]: For 73093/74533 co-relation queries the response was YES. [2023-08-27 03:45:15,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89729 conditions, 18766 events. 13128/18766 cut-off events. For 73093/74533 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 110007 event pairs, 1685 based on Foata normal form. 798/18730 useless extension candidates. Maximal degree in co-relation 89702. Up to 13275 conditions per place. [2023-08-27 03:45:15,905 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 121 selfloop transitions, 37 changer transitions 0/174 dead transitions. [2023-08-27 03:45:15,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 174 transitions, 1712 flow [2023-08-27 03:45:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-08-27 03:45:15,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488030888030888 [2023-08-27 03:45:15,907 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-08-27 03:45:15,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-08-27 03:45:15,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:15,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-08-27 03:45:15,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,911 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,911 INFO L175 Difference]: Start difference. First operand has 69 places, 101 transitions, 892 flow. Second operand 5 states and 632 transitions. [2023-08-27 03:45:15,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 174 transitions, 1712 flow [2023-08-27 03:45:15,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 174 transitions, 1694 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:15,948 INFO L231 Difference]: Finished difference. Result has 72 places, 115 transitions, 1137 flow [2023-08-27 03:45:15,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1137, PETRI_PLACES=72, PETRI_TRANSITIONS=115} [2023-08-27 03:45:15,948 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-27 03:45:15,948 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 115 transitions, 1137 flow [2023-08-27 03:45:15,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:15,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:15,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:45:15,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:15,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1519363441, now seen corresponding path program 2 times [2023-08-27 03:45:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910969029] [2023-08-27 03:45:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910969029] [2023-08-27 03:45:16,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910969029] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:16,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279513670] [2023-08-27 03:45:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:16,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:16,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 259 [2023-08-27 03:45:16,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 115 transitions, 1137 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:16,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:16,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 259 [2023-08-27 03:45:16,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:18,676 INFO L124 PetriNetUnfolderBase]: 16788/22984 cut-off events. [2023-08-27 03:45:18,676 INFO L125 PetriNetUnfolderBase]: For 87980/87980 co-relation queries the response was YES. [2023-08-27 03:45:18,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116095 conditions, 22984 events. 16788/22984 cut-off events. For 87980/87980 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 120624 event pairs, 1535 based on Foata normal form. 32/22409 useless extension candidates. Maximal degree in co-relation 116067. Up to 18352 conditions per place. [2023-08-27 03:45:18,820 INFO L140 encePairwiseOnDemand]: 249/259 looper letters, 203 selfloop transitions, 60 changer transitions 0/263 dead transitions. [2023-08-27 03:45:18,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 263 transitions, 2809 flow [2023-08-27 03:45:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2023-08-27 03:45:18,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473248758963045 [2023-08-27 03:45:18,823 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2023-08-27 03:45:18,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2023-08-27 03:45:18,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:18,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2023-08-27 03:45:18,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:18,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:18,828 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:18,828 INFO L175 Difference]: Start difference. First operand has 72 places, 115 transitions, 1137 flow. Second operand 7 states and 811 transitions. [2023-08-27 03:45:18,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 263 transitions, 2809 flow [2023-08-27 03:45:18,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 263 transitions, 2710 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:18,904 INFO L231 Difference]: Finished difference. Result has 79 places, 147 transitions, 1607 flow [2023-08-27 03:45:18,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1607, PETRI_PLACES=79, PETRI_TRANSITIONS=147} [2023-08-27 03:45:18,905 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2023-08-27 03:45:18,905 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 147 transitions, 1607 flow [2023-08-27 03:45:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:18,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:18,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:18,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:45:18,906 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:18,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1994492359, now seen corresponding path program 3 times [2023-08-27 03:45:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393558814] [2023-08-27 03:45:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393558814] [2023-08-27 03:45:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393558814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:19,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:19,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222919195] [2023-08-27 03:45:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:19,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:19,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 259 [2023-08-27 03:45:19,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 147 transitions, 1607 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:19,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:19,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 259 [2023-08-27 03:45:19,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:21,584 INFO L124 PetriNetUnfolderBase]: 15137/21655 cut-off events. [2023-08-27 03:45:21,585 INFO L125 PetriNetUnfolderBase]: For 147139/149127 co-relation queries the response was YES. [2023-08-27 03:45:21,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121162 conditions, 21655 events. 15137/21655 cut-off events. For 147139/149127 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 130389 event pairs, 1724 based on Foata normal form. 1277/21939 useless extension candidates. Maximal degree in co-relation 121130. Up to 11622 conditions per place. [2023-08-27 03:45:21,746 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 159 selfloop transitions, 61 changer transitions 0/236 dead transitions. [2023-08-27 03:45:21,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 236 transitions, 2807 flow [2023-08-27 03:45:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2023-08-27 03:45:21,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49266409266409267 [2023-08-27 03:45:21,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2023-08-27 03:45:21,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2023-08-27 03:45:21,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:21,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2023-08-27 03:45:21,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:21,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:21,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:21,751 INFO L175 Difference]: Start difference. First operand has 79 places, 147 transitions, 1607 flow. Second operand 5 states and 638 transitions. [2023-08-27 03:45:21,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 236 transitions, 2807 flow [2023-08-27 03:45:21,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 236 transitions, 2744 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:21,882 INFO L231 Difference]: Finished difference. Result has 83 places, 155 transitions, 1856 flow [2023-08-27 03:45:21,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1856, PETRI_PLACES=83, PETRI_TRANSITIONS=155} [2023-08-27 03:45:21,882 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-27 03:45:21,882 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 155 transitions, 1856 flow [2023-08-27 03:45:21,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:21,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:21,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:21,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:45:21,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:21,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1475081602, now seen corresponding path program 1 times [2023-08-27 03:45:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318896362] [2023-08-27 03:45:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:21,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318896362] [2023-08-27 03:45:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318896362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:21,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733918591] [2023-08-27 03:45:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:21,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:21,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:21,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:45:21,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 155 transitions, 1856 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:21,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:21,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:45:21,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:24,791 INFO L124 PetriNetUnfolderBase]: 14047/19500 cut-off events. [2023-08-27 03:45:24,791 INFO L125 PetriNetUnfolderBase]: For 211588/214553 co-relation queries the response was YES. [2023-08-27 03:45:24,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120937 conditions, 19500 events. 14047/19500 cut-off events. For 211588/214553 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 114021 event pairs, 1332 based on Foata normal form. 1671/20730 useless extension candidates. Maximal degree in co-relation 120903. Up to 9940 conditions per place. [2023-08-27 03:45:24,981 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 333 selfloop transitions, 13 changer transitions 0/365 dead transitions. [2023-08-27 03:45:24,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 365 transitions, 5343 flow [2023-08-27 03:45:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-08-27 03:45:24,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965250965250965 [2023-08-27 03:45:24,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-08-27 03:45:24,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-08-27 03:45:24,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:24,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-08-27 03:45:24,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:24,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:24,988 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:24,988 INFO L175 Difference]: Start difference. First operand has 83 places, 155 transitions, 1856 flow. Second operand 5 states and 643 transitions. [2023-08-27 03:45:24,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 365 transitions, 5343 flow [2023-08-27 03:45:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 365 transitions, 5064 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:25,130 INFO L231 Difference]: Finished difference. Result has 85 places, 159 transitions, 1828 flow [2023-08-27 03:45:25,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1828, PETRI_PLACES=85, PETRI_TRANSITIONS=159} [2023-08-27 03:45:25,130 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-27 03:45:25,130 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 159 transitions, 1828 flow [2023-08-27 03:45:25,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:25,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:25,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:25,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:45:25,131 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:25,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash 425382713, now seen corresponding path program 1 times [2023-08-27 03:45:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288250541] [2023-08-27 03:45:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:25,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:25,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288250541] [2023-08-27 03:45:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288250541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621908698] [2023-08-27 03:45:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:25,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:45:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:45:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:45:25,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 259 [2023-08-27 03:45:25,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 159 transitions, 1828 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:25,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:25,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 259 [2023-08-27 03:45:25,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:28,848 INFO L124 PetriNetUnfolderBase]: 15802/22468 cut-off events. [2023-08-27 03:45:28,848 INFO L125 PetriNetUnfolderBase]: For 172756/174943 co-relation queries the response was YES. [2023-08-27 03:45:28,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131772 conditions, 22468 events. 15802/22468 cut-off events. For 172756/174943 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 135557 event pairs, 1570 based on Foata normal form. 1324/23236 useless extension candidates. Maximal degree in co-relation 131737. Up to 10815 conditions per place. [2023-08-27 03:45:29,015 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 184 selfloop transitions, 62 changer transitions 0/262 dead transitions. [2023-08-27 03:45:29,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 262 transitions, 3250 flow [2023-08-27 03:45:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:45:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:45:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2023-08-27 03:45:29,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47554697554697556 [2023-08-27 03:45:29,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2023-08-27 03:45:29,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2023-08-27 03:45:29,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:29,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2023-08-27 03:45:29,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:29,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:29,022 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:29,022 INFO L175 Difference]: Start difference. First operand has 85 places, 159 transitions, 1828 flow. Second operand 6 states and 739 transitions. [2023-08-27 03:45:29,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 262 transitions, 3250 flow [2023-08-27 03:45:29,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 262 transitions, 3138 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:29,306 INFO L231 Difference]: Finished difference. Result has 88 places, 164 transitions, 2029 flow [2023-08-27 03:45:29,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1794, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2029, PETRI_PLACES=88, PETRI_TRANSITIONS=164} [2023-08-27 03:45:29,307 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2023-08-27 03:45:29,307 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 164 transitions, 2029 flow [2023-08-27 03:45:29,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:29,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:29,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:29,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:45:29,308 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:29,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1789977383, now seen corresponding path program 1 times [2023-08-27 03:45:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:29,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91857204] [2023-08-27 03:45:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:30,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91857204] [2023-08-27 03:45:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91857204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509298780] [2023-08-27 03:45:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:45:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:45:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:45:30,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:45:30,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 164 transitions, 2029 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:30,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:30,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:45:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:33,198 INFO L124 PetriNetUnfolderBase]: 16026/22812 cut-off events. [2023-08-27 03:45:33,198 INFO L125 PetriNetUnfolderBase]: For 198167/200489 co-relation queries the response was YES. [2023-08-27 03:45:33,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136184 conditions, 22812 events. 16026/22812 cut-off events. For 198167/200489 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 138290 event pairs, 1639 based on Foata normal form. 1383/23603 useless extension candidates. Maximal degree in co-relation 136148. Up to 10814 conditions per place. [2023-08-27 03:45:33,372 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 163 selfloop transitions, 62 changer transitions 0/241 dead transitions. [2023-08-27 03:45:33,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 3137 flow [2023-08-27 03:45:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-27 03:45:33,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48416988416988416 [2023-08-27 03:45:33,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-27 03:45:33,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-27 03:45:33,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:33,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-27 03:45:33,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:33,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:33,377 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:33,377 INFO L175 Difference]: Start difference. First operand has 88 places, 164 transitions, 2029 flow. Second operand 5 states and 627 transitions. [2023-08-27 03:45:33,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 241 transitions, 3137 flow [2023-08-27 03:45:33,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 241 transitions, 2960 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-27 03:45:33,737 INFO L231 Difference]: Finished difference. Result has 88 places, 168 transitions, 2107 flow [2023-08-27 03:45:33,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2107, PETRI_PLACES=88, PETRI_TRANSITIONS=168} [2023-08-27 03:45:33,738 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2023-08-27 03:45:33,738 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 168 transitions, 2107 flow [2023-08-27 03:45:33,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:33,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:33,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:45:33,739 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:33,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:33,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1415395935, now seen corresponding path program 1 times [2023-08-27 03:45:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:33,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195504355] [2023-08-27 03:45:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:33,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195504355] [2023-08-27 03:45:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195504355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:33,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890203110] [2023-08-27 03:45:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:33,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-08-27 03:45:33,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 168 transitions, 2107 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:33,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:33,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-08-27 03:45:33,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:34,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][248], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 25#L764true, 4#L797true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:34,993 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,993 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,993 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][145], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 25#L764true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:34,994 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L3-->L862: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_In_1 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_In_1 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_In_1 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_In_1) v_~y$w_buff1_used~0_Out_2) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_Out_2 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 0 v_~y$r_buff1_thd0~0_In_1) v_~y$r_buff1_thd0~0_Out_2) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_In_1) v_~y$r_buff0_thd0~0_Out_2) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0)) (= v_~y~0_Out_2 (ite .cse4 v_~y$w_buff0~0_In_1 (ite .cse0 v_~y$w_buff1~0_In_1 v_~y~0_In_1))) (= (ite .cse4 0 v_~y$w_buff0_used~0_In_1) v_~y$w_buff0_used~0_Out_2)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~y~0=v_~y~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_In_1, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_Out_2, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~y~0=v_~y~0_Out_2, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][186], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 92#L862true, 261#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 25#L764true, 4#L797true, Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:34,994 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,994 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:34,995 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][247], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 25#L764true, 4#L797true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,060 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][303], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 25#L764true, 268#true, Black: 179#(= ~x~0 0), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,060 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,060 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:35,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][153], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 111#L767true, 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,385 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,385 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,385 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,385 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][295], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 111#L767true, 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 4#L797true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,385 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,385 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,385 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,386 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][103], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 108#L774true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 4#L797true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,386 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,386 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,386 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,386 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][302], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, 111#L767true, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 15#L804true, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,460 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][294], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, 111#L767true, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 4#L797true, 268#true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,460 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][243], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 108#L774true, Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 4#L797true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:35,461 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:35,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:36,506 INFO L124 PetriNetUnfolderBase]: 12297/17711 cut-off events. [2023-08-27 03:45:36,506 INFO L125 PetriNetUnfolderBase]: For 228647/234928 co-relation queries the response was YES. [2023-08-27 03:45:36,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111501 conditions, 17711 events. 12297/17711 cut-off events. For 228647/234928 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 110420 event pairs, 1239 based on Foata normal form. 4266/21180 useless extension candidates. Maximal degree in co-relation 111465. Up to 10855 conditions per place. [2023-08-27 03:45:36,644 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 392 selfloop transitions, 10 changer transitions 4/425 dead transitions. [2023-08-27 03:45:36,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 425 transitions, 6611 flow [2023-08-27 03:45:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-27 03:45:36,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4694980694980695 [2023-08-27 03:45:36,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-27 03:45:36,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-27 03:45:36,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:36,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-27 03:45:36,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:36,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:36,650 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:36,650 INFO L175 Difference]: Start difference. First operand has 88 places, 168 transitions, 2107 flow. Second operand 5 states and 608 transitions. [2023-08-27 03:45:36,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 425 transitions, 6611 flow [2023-08-27 03:45:37,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 425 transitions, 6340 flow, removed 25 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:37,048 INFO L231 Difference]: Finished difference. Result has 92 places, 173 transitions, 2121 flow [2023-08-27 03:45:37,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2121, PETRI_PLACES=92, PETRI_TRANSITIONS=173} [2023-08-27 03:45:37,048 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2023-08-27 03:45:37,049 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 173 transitions, 2121 flow [2023-08-27 03:45:37,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:37,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:37,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:45:37,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:37,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1337649499, now seen corresponding path program 1 times [2023-08-27 03:45:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904497191] [2023-08-27 03:45:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904497191] [2023-08-27 03:45:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904497191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:37,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575148435] [2023-08-27 03:45:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:37,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:37,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-08-27 03:45:37,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 173 transitions, 2121 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:37,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:37,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-08-27 03:45:37,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:38,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][250], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 25#L764true, 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,153 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,153 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,154 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,154 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][296], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 15#L804true, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,154 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,154 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,154 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,154 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][250], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 25#L764true, 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,203 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,203 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,203 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,203 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][296], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,203 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,203 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,204 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,204 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:38,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][295], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 111#L767true, 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,421 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,421 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,421 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,421 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][300], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 111#L767true, 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,421 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][245], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 108#L774true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), 279#true, Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,422 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,422 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][295], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, 111#L767true, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 15#L804true, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,460 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,460 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][300], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, 111#L767true, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,461 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][245], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 108#L774true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 169#(<= ~__unbuffered_cnt~0 1), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:38,461 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,462 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,462 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,462 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:38,920 INFO L124 PetriNetUnfolderBase]: 8491/12563 cut-off events. [2023-08-27 03:45:38,920 INFO L125 PetriNetUnfolderBase]: For 189996/196767 co-relation queries the response was YES. [2023-08-27 03:45:38,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79215 conditions, 12563 events. 8491/12563 cut-off events. For 189996/196767 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 79053 event pairs, 499 based on Foata normal form. 4007/15983 useless extension candidates. Maximal degree in co-relation 79176. Up to 6488 conditions per place. [2023-08-27 03:45:39,016 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 460 selfloop transitions, 19 changer transitions 4/502 dead transitions. [2023-08-27 03:45:39,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 502 transitions, 7719 flow [2023-08-27 03:45:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2023-08-27 03:45:39,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468284611141754 [2023-08-27 03:45:39,018 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2023-08-27 03:45:39,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2023-08-27 03:45:39,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:39,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2023-08-27 03:45:39,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,023 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,023 INFO L175 Difference]: Start difference. First operand has 92 places, 173 transitions, 2121 flow. Second operand 7 states and 849 transitions. [2023-08-27 03:45:39,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 502 transitions, 7719 flow [2023-08-27 03:45:39,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 502 transitions, 7657 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:39,506 INFO L231 Difference]: Finished difference. Result has 99 places, 159 transitions, 1948 flow [2023-08-27 03:45:39,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1948, PETRI_PLACES=99, PETRI_TRANSITIONS=159} [2023-08-27 03:45:39,507 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 49 predicate places. [2023-08-27 03:45:39,507 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 159 transitions, 1948 flow [2023-08-27 03:45:39,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:39,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:39,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:45:39,508 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:39,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1695244739, now seen corresponding path program 1 times [2023-08-27 03:45:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:39,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25511244] [2023-08-27 03:45:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25511244] [2023-08-27 03:45:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25511244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144168842] [2023-08-27 03:45:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:39,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:39,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:39,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259 [2023-08-27 03:45:39,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 159 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:39,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259 [2023-08-27 03:45:39,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:42,167 INFO L124 PetriNetUnfolderBase]: 11788/18230 cut-off events. [2023-08-27 03:45:42,167 INFO L125 PetriNetUnfolderBase]: For 218085/221132 co-relation queries the response was YES. [2023-08-27 03:45:42,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118581 conditions, 18230 events. 11788/18230 cut-off events. For 218085/221132 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 126464 event pairs, 2438 based on Foata normal form. 1932/19089 useless extension candidates. Maximal degree in co-relation 118539. Up to 9065 conditions per place. [2023-08-27 03:45:42,321 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 242 selfloop transitions, 11 changer transitions 0/267 dead transitions. [2023-08-27 03:45:42,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 267 transitions, 3848 flow [2023-08-27 03:45:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-27 03:45:42,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070785070785071 [2023-08-27 03:45:42,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-27 03:45:42,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-27 03:45:42,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:42,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-27 03:45:42,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 259.0) internal successors, (1036), 4 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,324 INFO L175 Difference]: Start difference. First operand has 99 places, 159 transitions, 1948 flow. Second operand 3 states and 394 transitions. [2023-08-27 03:45:42,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 267 transitions, 3848 flow [2023-08-27 03:45:42,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 267 transitions, 3782 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-27 03:45:42,957 INFO L231 Difference]: Finished difference. Result has 98 places, 159 transitions, 1949 flow [2023-08-27 03:45:42,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1949, PETRI_PLACES=98, PETRI_TRANSITIONS=159} [2023-08-27 03:45:42,957 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2023-08-27 03:45:42,957 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 159 transitions, 1949 flow [2023-08-27 03:45:42,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:42,958 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] [2023-08-27 03:45:42,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:45:42,958 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:42,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -912673789, now seen corresponding path program 1 times [2023-08-27 03:45:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219382655] [2023-08-27 03:45:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219382655] [2023-08-27 03:45:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219382655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48598369] [2023-08-27 03:45:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:43,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:43,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:43,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-08-27 03:45:43,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 159 transitions, 1949 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:43,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-08-27 03:45:43,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:44,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][251], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), Black: 304#(= ~x~0 1), 25#L764true, 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,551 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,551 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,551 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,551 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][295], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 15#L804true, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,552 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,552 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,552 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,552 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][251], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 4#L797true, Black: 304#(= ~x~0 1), 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,618 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,618 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,618 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,618 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][295], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,619 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,619 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,619 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,619 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:44,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][294], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, 111#L767true, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,785 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,785 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,785 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,785 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][300], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, 111#L767true, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), Black: 304#(= ~x~0 1), 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,785 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][245], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 108#L774true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 4#L797true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 179#(= ~x~0 0), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,786 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,786 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][294], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 111#L767true, 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,822 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][300], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 111#L767true, 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 4#L797true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,822 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,822 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][245], [Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 113#P0EXITtrue, Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 302#true, Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 159#(<= ~__unbuffered_cnt~0 0), 72#L3true, 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 108#L774true, Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 228#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, 4#L797true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 179#(= ~x~0 0), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:44,823 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,823 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,823 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:44,823 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:45,461 INFO L124 PetriNetUnfolderBase]: 10130/15003 cut-off events. [2023-08-27 03:45:45,461 INFO L125 PetriNetUnfolderBase]: For 235591/243213 co-relation queries the response was YES. [2023-08-27 03:45:45,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99244 conditions, 15003 events. 10130/15003 cut-off events. For 235591/243213 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 98359 event pairs, 458 based on Foata normal form. 3989/18138 useless extension candidates. Maximal degree in co-relation 99202. Up to 7898 conditions per place. [2023-08-27 03:45:45,559 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 476 selfloop transitions, 28 changer transitions 4/527 dead transitions. [2023-08-27 03:45:45,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 527 transitions, 8201 flow [2023-08-27 03:45:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:45:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:45:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1088 transitions. [2023-08-27 03:45:45,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46675246675246673 [2023-08-27 03:45:45,562 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1088 transitions. [2023-08-27 03:45:45,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1088 transitions. [2023-08-27 03:45:45,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:45,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1088 transitions. [2023-08-27 03:45:45,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:45,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:45,567 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 259.0) internal successors, (2590), 10 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:45,567 INFO L175 Difference]: Start difference. First operand has 98 places, 159 transitions, 1949 flow. Second operand 9 states and 1088 transitions. [2023-08-27 03:45:45,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 527 transitions, 8201 flow [2023-08-27 03:45:46,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 527 transitions, 7845 flow, removed 47 selfloop flow, removed 6 redundant places. [2023-08-27 03:45:46,494 INFO L231 Difference]: Finished difference. Result has 103 places, 150 transitions, 1768 flow [2023-08-27 03:45:46,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1768, PETRI_PLACES=103, PETRI_TRANSITIONS=150} [2023-08-27 03:45:46,494 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2023-08-27 03:45:46,494 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 150 transitions, 1768 flow [2023-08-27 03:45:46,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:46,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:46,494 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] [2023-08-27 03:45:46,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 03:45:46,495 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:46,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:46,495 INFO L85 PathProgramCache]: Analyzing trace with hash -187083626, now seen corresponding path program 1 times [2023-08-27 03:45:46,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:46,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614642020] [2023-08-27 03:45:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:46,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614642020] [2023-08-27 03:45:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614642020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:46,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969688446] [2023-08-27 03:45:46,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:46,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:46,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:46,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:46,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 259 [2023-08-27 03:45:46,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 150 transitions, 1768 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:46,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:46,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 259 [2023-08-27 03:45:46,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:47,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][163], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 174#(= ~z~0 0), 4#L797true, Black: 304#(= ~x~0 1), 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:47,624 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][113], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 25#L764true, 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:47,624 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,624 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:47,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][118], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, 111#L767true, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:47,982 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][191], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, 111#L767true, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 174#(= ~z~0 0), 4#L797true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:47,982 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][87], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 108#L774true, Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 174#(= ~z~0 0), 17#L820true, 4#L797true, Black: 304#(= ~x~0 1), 297#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:47,982 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,982 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,983 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:47,983 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:48,522 INFO L124 PetriNetUnfolderBase]: 9683/14525 cut-off events. [2023-08-27 03:45:48,522 INFO L125 PetriNetUnfolderBase]: For 196545/202118 co-relation queries the response was YES. [2023-08-27 03:45:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98064 conditions, 14525 events. 9683/14525 cut-off events. For 196545/202118 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 96817 event pairs, 881 based on Foata normal form. 2541/16177 useless extension candidates. Maximal degree in co-relation 98021. Up to 7664 conditions per place. [2023-08-27 03:45:48,630 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 230 selfloop transitions, 29 changer transitions 25/303 dead transitions. [2023-08-27 03:45:48,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 303 transitions, 4428 flow [2023-08-27 03:45:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:45:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:45:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-27 03:45:48,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794079794079794 [2023-08-27 03:45:48,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-27 03:45:48,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-27 03:45:48,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:48,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-27 03:45:48,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:48,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:48,636 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:48,636 INFO L175 Difference]: Start difference. First operand has 103 places, 150 transitions, 1768 flow. Second operand 6 states and 745 transitions. [2023-08-27 03:45:48,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 303 transitions, 4428 flow [2023-08-27 03:45:49,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 4374 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 03:45:49,890 INFO L231 Difference]: Finished difference. Result has 98 places, 138 transitions, 1615 flow [2023-08-27 03:45:49,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1615, PETRI_PLACES=98, PETRI_TRANSITIONS=138} [2023-08-27 03:45:49,890 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2023-08-27 03:45:49,890 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 138 transitions, 1615 flow [2023-08-27 03:45:49,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:49,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:49,891 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] [2023-08-27 03:45:49,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 03:45:49,891 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:49,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2119418144, now seen corresponding path program 1 times [2023-08-27 03:45:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643060949] [2023-08-27 03:45:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:50,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643060949] [2023-08-27 03:45:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643060949] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:50,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:50,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:45:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156102318] [2023-08-27 03:45:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:50,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:45:50,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:45:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:45:50,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 259 [2023-08-27 03:45:50,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 138 transitions, 1615 flow. Second operand has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:50,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:50,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 259 [2023-08-27 03:45:50,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:51,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][244], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), Black: 304#(= ~x~0 1), 25#L764true, 4#L797true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,148 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,148 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,148 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,148 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][285], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 25#L764true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,149 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,149 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,149 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,149 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][244], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), Black: 304#(= ~x~0 1), 25#L764true, 4#L797true, 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,196 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,196 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,196 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,196 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][285], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 25#L764true, 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,197 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,197 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,197 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,197 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][284], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, 111#L767true, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 326#(<= ~__unbuffered_cnt~0 1), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,371 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][289], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, 111#L767true, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 326#(<= ~__unbuffered_cnt~0 1), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), Black: 304#(= ~x~0 1), 4#L797true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,371 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,371 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,372 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][239], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 326#(<= ~__unbuffered_cnt~0 1), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 108#L774true, Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 4#L797true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,372 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,372 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,372 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,372 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L797-->L804: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_93 256))))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= 0 (mod v_~y$w_buff0_used~0_94 256))) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd3~0_26 (ite .cse0 0 v_~y$r_buff0_thd3~0_27)) (= (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd3~0_26 256))) .cse1) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_88 256) 0)))) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17) (= (ite .cse3 0 v_~y$w_buff0_used~0_94) v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_88 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_89)) (= v_~y~0_47 (ite .cse3 v_~y$w_buff0~0_35 (ite .cse4 v_~y$w_buff1~0_32 v_~y~0_48)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_48, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][284], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, 111#L767true, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, 15#L804true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,410 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][289], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, 111#L767true, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, Black: 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), P1Thread1of1ForFork3InUse, 96#L827true, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 326#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), Black: 304#(= ~x~0 1), 4#L797true, Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,410 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L767-->L774: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_127 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_128 256) 0))))) (and (= v_~y~0_73 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_74))) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff1_used~0_118 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_119)) (= v_~y$w_buff0_used~0_127 (ite .cse0 0 v_~y$w_buff0_used~0_128))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_74, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_127, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_73, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][239], [Black: 312#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 188#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 318#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 113#P0EXITtrue, Black: 311#(<= ~__unbuffered_cnt~0 2), Black: 195#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 259#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (= ~y~0 1)), 155#(<= 0 ~__unbuffered_cnt~0), 273#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))), Black: 205#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 202#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P2Thread1of1ForFork0InUse, 177#true, P3Thread1of1ForFork2InUse, 185#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, Black: 213#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 281#(<= ~__unbuffered_cnt~0 0), 326#(<= ~__unbuffered_cnt~0 1), Black: 284#(and (<= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 222#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 72#L3true, Black: 159#(<= ~__unbuffered_cnt~0 0), 316#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 230#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 108#L774true, Black: 292#(<= ~__unbuffered_cnt~0 1), Black: 293#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 232#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 174#(= ~z~0 0), 17#L820true, Black: 304#(= ~x~0 1), 4#L797true, 282#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 243#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 180#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 340#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 252#(<= ~__unbuffered_cnt~0 2), Black: 187#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-27 03:45:51,410 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,411 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,411 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,411 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-27 03:45:51,973 INFO L124 PetriNetUnfolderBase]: 9815/14471 cut-off events. [2023-08-27 03:45:51,973 INFO L125 PetriNetUnfolderBase]: For 208492/215443 co-relation queries the response was YES. [2023-08-27 03:45:52,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97615 conditions, 14471 events. 9815/14471 cut-off events. For 208492/215443 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 95067 event pairs, 413 based on Foata normal form. 3116/16809 useless extension candidates. Maximal degree in co-relation 97572. Up to 7590 conditions per place. [2023-08-27 03:45:52,052 INFO L140 encePairwiseOnDemand]: 252/259 looper letters, 312 selfloop transitions, 33 changer transitions 125/486 dead transitions. [2023-08-27 03:45:52,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 486 transitions, 7269 flow [2023-08-27 03:45:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 03:45:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 03:45:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1295 transitions. [2023-08-27 03:45:52,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-08-27 03:45:52,055 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1295 transitions. [2023-08-27 03:45:52,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1295 transitions. [2023-08-27 03:45:52,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:52,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1295 transitions. [2023-08-27 03:45:52,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.72727272727273) internal successors, (1295), 11 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 259.0) internal successors, (3108), 12 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,060 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 259.0) internal successors, (3108), 12 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,060 INFO L175 Difference]: Start difference. First operand has 98 places, 138 transitions, 1615 flow. Second operand 11 states and 1295 transitions. [2023-08-27 03:45:52,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 486 transitions, 7269 flow [2023-08-27 03:45:53,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 486 transitions, 6875 flow, removed 124 selfloop flow, removed 9 redundant places. [2023-08-27 03:45:53,424 INFO L231 Difference]: Finished difference. Result has 102 places, 126 transitions, 1375 flow [2023-08-27 03:45:53,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1375, PETRI_PLACES=102, PETRI_TRANSITIONS=126} [2023-08-27 03:45:53,424 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2023-08-27 03:45:53,424 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 126 transitions, 1375 flow [2023-08-27 03:45:53,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:53,514 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] [2023-08-27 03:45:53,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 03:45:53,515 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:53,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1461890777, now seen corresponding path program 1 times [2023-08-27 03:45:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83337097] [2023-08-27 03:45:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83337097] [2023-08-27 03:45:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83337097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:53,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:53,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:53,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883031729] [2023-08-27 03:45:53,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:53,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:53,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:53,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:53,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:53,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 259 [2023-08-27 03:45:53,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 126 transitions, 1375 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:53,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 259 [2023-08-27 03:45:53,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:55,293 INFO L124 PetriNetUnfolderBase]: 6858/10320 cut-off events. [2023-08-27 03:45:55,293 INFO L125 PetriNetUnfolderBase]: For 77783/77783 co-relation queries the response was YES. [2023-08-27 03:45:55,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63197 conditions, 10320 events. 6858/10320 cut-off events. For 77783/77783 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 61105 event pairs, 884 based on Foata normal form. 1/10321 useless extension candidates. Maximal degree in co-relation 63156. Up to 4968 conditions per place. [2023-08-27 03:45:55,330 INFO L140 encePairwiseOnDemand]: 246/259 looper letters, 81 selfloop transitions, 39 changer transitions 174/294 dead transitions. [2023-08-27 03:45:55,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 294 transitions, 3633 flow [2023-08-27 03:45:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:45:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:45:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-08-27 03:45:55,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317889317889318 [2023-08-27 03:45:55,331 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-08-27 03:45:55,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-08-27 03:45:55,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:55,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-08-27 03:45:55,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:55,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:55,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 259.0) internal successors, (1813), 7 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:55,334 INFO L175 Difference]: Start difference. First operand has 102 places, 126 transitions, 1375 flow. Second operand 6 states and 671 transitions. [2023-08-27 03:45:55,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 294 transitions, 3633 flow [2023-08-27 03:45:55,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 294 transitions, 3338 flow, removed 27 selfloop flow, removed 12 redundant places. [2023-08-27 03:45:55,603 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 1118 flow [2023-08-27 03:45:55,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1118, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2023-08-27 03:45:55,603 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2023-08-27 03:45:55,603 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 1118 flow [2023-08-27 03:45:55,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:55,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:55,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:55,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 03:45:55,604 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:55,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2146657623, now seen corresponding path program 2 times [2023-08-27 03:45:55,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:55,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656494866] [2023-08-27 03:45:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656494866] [2023-08-27 03:45:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656494866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597659779] [2023-08-27 03:45:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:56,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:56,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:56,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 259 [2023-08-27 03:45:56,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 1118 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:56,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:56,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 259 [2023-08-27 03:45:56,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:56,350 INFO L124 PetriNetUnfolderBase]: 1087/1813 cut-off events. [2023-08-27 03:45:56,350 INFO L125 PetriNetUnfolderBase]: For 12132/12132 co-relation queries the response was YES. [2023-08-27 03:45:56,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10962 conditions, 1813 events. 1087/1813 cut-off events. For 12132/12132 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9055 event pairs, 124 based on Foata normal form. 1/1814 useless extension candidates. Maximal degree in co-relation 10928. Up to 949 conditions per place. [2023-08-27 03:45:56,361 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 57 selfloop transitions, 11 changer transitions 82/150 dead transitions. [2023-08-27 03:45:56,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 150 transitions, 1920 flow [2023-08-27 03:45:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2023-08-27 03:45:56,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391891891891892 [2023-08-27 03:45:56,362 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2023-08-27 03:45:56,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2023-08-27 03:45:56,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:56,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2023-08-27 03:45:56,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:56,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:56,365 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 259.0) internal successors, (1295), 5 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:56,365 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 1118 flow. Second operand 4 states and 455 transitions. [2023-08-27 03:45:56,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 150 transitions, 1920 flow [2023-08-27 03:45:56,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 150 transitions, 1839 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-08-27 03:45:56,397 INFO L231 Difference]: Finished difference. Result has 86 places, 54 transitions, 511 flow [2023-08-27 03:45:56,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2023-08-27 03:45:56,397 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 36 predicate places. [2023-08-27 03:45:56,397 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 511 flow [2023-08-27 03:45:56,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:56,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:56,398 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] [2023-08-27 03:45:56,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 03:45:56,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:56,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash 620784811, now seen corresponding path program 3 times [2023-08-27 03:45:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:56,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463729874] [2023-08-27 03:45:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463729874] [2023-08-27 03:45:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463729874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835207574] [2023-08-27 03:45:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:57,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:57,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:57,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 259 [2023-08-27 03:45:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 54 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:57,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:57,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 259 [2023-08-27 03:45:57,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:57,524 INFO L124 PetriNetUnfolderBase]: 329/586 cut-off events. [2023-08-27 03:45:57,525 INFO L125 PetriNetUnfolderBase]: For 4057/4061 co-relation queries the response was YES. [2023-08-27 03:45:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 586 events. 329/586 cut-off events. For 4057/4061 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2347 event pairs, 34 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 3184. Up to 388 conditions per place. [2023-08-27 03:45:57,529 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 55 selfloop transitions, 14 changer transitions 8/81 dead transitions. [2023-08-27 03:45:57,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 840 flow [2023-08-27 03:45:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-08-27 03:45:57,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2023-08-27 03:45:57,531 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-08-27 03:45:57,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-08-27 03:45:57,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:57,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-08-27 03:45:57,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:57,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:57,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:57,534 INFO L175 Difference]: Start difference. First operand has 86 places, 54 transitions, 511 flow. Second operand 5 states and 581 transitions. [2023-08-27 03:45:57,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 840 flow [2023-08-27 03:45:57,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 672 flow, removed 35 selfloop flow, removed 20 redundant places. [2023-08-27 03:45:57,543 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 410 flow [2023-08-27 03:45:57,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-08-27 03:45:57,543 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-08-27 03:45:57,544 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 410 flow [2023-08-27 03:45:57,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:57,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:57,544 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] [2023-08-27 03:45:57,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-27 03:45:57,544 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:57,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 278618657, now seen corresponding path program 4 times [2023-08-27 03:45:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214303712] [2023-08-27 03:45:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214303712] [2023-08-27 03:45:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214303712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:58,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:58,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:45:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140292922] [2023-08-27 03:45:58,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:58,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:45:58,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:45:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:45:58,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 259 [2023-08-27 03:45:58,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 410 flow. Second operand has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:58,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:58,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 259 [2023-08-27 03:45:58,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:59,183 INFO L124 PetriNetUnfolderBase]: 349/632 cut-off events. [2023-08-27 03:45:59,183 INFO L125 PetriNetUnfolderBase]: For 2159/2163 co-relation queries the response was YES. [2023-08-27 03:45:59,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2922 conditions, 632 events. 349/632 cut-off events. For 2159/2163 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2598 event pairs, 43 based on Foata normal form. 1/630 useless extension candidates. Maximal degree in co-relation 2898. Up to 194 conditions per place. [2023-08-27 03:45:59,185 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 49 selfloop transitions, 9 changer transitions 41/103 dead transitions. [2023-08-27 03:45:59,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 905 flow [2023-08-27 03:45:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-08-27 03:45:59,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307777164920022 [2023-08-27 03:45:59,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-08-27 03:45:59,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-08-27 03:45:59,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:59,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-08-27 03:45:59,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:59,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:59,191 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 259.0) internal successors, (2072), 8 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:59,191 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 410 flow. Second operand 7 states and 781 transitions. [2023-08-27 03:45:59,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 905 flow [2023-08-27 03:45:59,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 878 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:59,196 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 395 flow [2023-08-27 03:45:59,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=395, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2023-08-27 03:45:59,196 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 24 predicate places. [2023-08-27 03:45:59,196 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 395 flow [2023-08-27 03:45:59,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:59,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:59,197 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] [2023-08-27 03:45:59,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-27 03:45:59,197 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:45:59,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash -769766277, now seen corresponding path program 5 times [2023-08-27 03:45:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836620948] [2023-08-27 03:45:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:59,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:45:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:59,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:45:59,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:45:59,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:45:59,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 03:45:59,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:45:59,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:45:59,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:45:59,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (17 of 23 remaining) [2023-08-27 03:45:59,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:45:59,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:45:59,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:45:59,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:45:59,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:45:59,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:45:59,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (4 of 23 remaining) [2023-08-27 03:45:59,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:45:59,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:45:59,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:45:59,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:45:59,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-27 03:45:59,300 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:59,306 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:45:59,306 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:45:59,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:45:59 BasicIcfg [2023-08-27 03:45:59,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:45:59,374 INFO L158 Benchmark]: Toolchain (without parser) took 69453.40ms. Allocated memory was 388.0MB in the beginning and 10.5GB in the end (delta: 10.1GB). Free memory was 363.3MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-27 03:45:59,374 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 388.0MB. Free memory is still 364.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:45:59,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.17ms. Allocated memory is still 388.0MB. Free memory was 362.8MB in the beginning and 339.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:59,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.11ms. Allocated memory is still 388.0MB. Free memory was 339.3MB in the beginning and 336.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:59,375 INFO L158 Benchmark]: Boogie Preprocessor took 51.11ms. Allocated memory is still 388.0MB. Free memory was 336.7MB in the beginning and 334.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:59,375 INFO L158 Benchmark]: RCFGBuilder took 690.11ms. Allocated memory is still 388.0MB. Free memory was 334.6MB in the beginning and 345.9MB in the end (delta: -11.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. [2023-08-27 03:45:59,376 INFO L158 Benchmark]: TraceAbstraction took 68033.39ms. Allocated memory was 388.0MB in the beginning and 10.5GB in the end (delta: 10.1GB). Free memory was 345.9MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-27 03:45:59,377 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 388.0MB. Free memory is still 364.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 594.17ms. Allocated memory is still 388.0MB. Free memory was 362.8MB in the beginning and 339.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.11ms. Allocated memory is still 388.0MB. Free memory was 339.3MB in the beginning and 336.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.11ms. Allocated memory is still 388.0MB. Free memory was 336.7MB in the beginning and 334.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 690.11ms. Allocated memory is still 388.0MB. Free memory was 334.6MB in the beginning and 345.9MB in the end (delta: -11.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.0GB. * TraceAbstraction took 68033.39ms. Allocated memory was 388.0MB in the beginning and 10.5GB in the end (delta: 10.1GB). Free memory was 345.9MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 146 PlacesBefore, 50 PlacesAfterwards, 136 TransitionsBefore, 37 TransitionsAfterwards, 4342 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 119 TotalNumberOfCompositions, 16528 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5759, independent: 5387, independent conditional: 0, independent unconditional: 5387, dependent: 372, dependent conditional: 0, dependent unconditional: 372, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2361, independent: 2277, independent conditional: 0, independent unconditional: 2277, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5759, independent: 3110, independent conditional: 0, independent unconditional: 3110, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 2361, unknown conditional: 0, unknown unconditional: 2361] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t805; [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t805, ((void *)0), P0, ((void *)0))=-3, t805={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t806; [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t806, ((void *)0), P1, ((void *)0))=-2, t805={5:0}, t806={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t807; [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t807, ((void *)0), P2, ((void *)0))=-1, t805={5:0}, t806={6:0}, t807={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t808; [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t808, ((void *)0), P3, ((void *)0))=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L756] EXPR 1 __unbuffered_cnt + 1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L829] EXPR 4 __unbuffered_cnt + 1 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L766] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L776] EXPR 2 __unbuffered_cnt + 1 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L806] EXPR 3 __unbuffered_cnt + 1 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 67.9s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1016 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1016 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2865 IncrementalHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 58 mSDtfsCounter, 2865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2121occurred in iteration=17, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 4321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:45:59,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...