./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:51:11,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:51:11,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:51:12,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:51:12,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:51:12,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:51:12,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:51:12,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:51:12,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:51:12,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:51:12,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:51:12,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:51:12,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:51:12,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:51:12,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:51:12,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:51:12,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:51:12,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:51:12,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:51:12,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:51:12,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:51:12,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:51:12,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:51:12,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:51:12,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:51:12,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:51:12,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:51:12,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:51:12,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:51:12,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:51:12,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:51:12,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:51:12,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:51:12,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:51:12,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:51:12,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:51:12,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:51:12,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:51:12,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:51:12,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:51:12,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:51:12,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:51:12,134 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:51:12,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:51:12,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:51:12,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:51:12,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:51:12,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:51:12,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:51:12,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:51:12,139 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:51:12,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:51:12,139 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:51:12,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:51:12,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:51:12,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:51:12,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:51:12,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:51:12,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:51:12,141 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:51:12,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:51:12,141 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:51:12,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:51:12,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:51:12,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:51:12,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:51:12,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:51:12,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:51:12,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:51:12,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:51:12,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:51:12,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:51:12,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:51:12,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:51:12,144 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:51:12,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:51:12,144 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:51:12,144 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:51:12,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:51:12,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:51:12,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:51:12,439 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:51:12,440 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:51:12,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-08-30 16:51:13,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:51:13,895 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:51:13,895 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-08-30 16:51:13,923 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57c516dd/9bb5fb571d5d45129f5d4fdb632efb22/FLAGb563080f8 [2023-08-30 16:51:13,944 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57c516dd/9bb5fb571d5d45129f5d4fdb632efb22 [2023-08-30 16:51:13,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:51:13,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:51:13,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:51:13,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:51:13,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:51:13,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:51:13" (1/1) ... [2023-08-30 16:51:13,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77593d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:13, skipping insertion in model container [2023-08-30 16:51:13,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:51:13" (1/1) ... [2023-08-30 16:51:13,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:51:14,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:51:14,139 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2023-08-30 16:51:14,375 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:51:14,389 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:51:14,400 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2023-08-30 16:51:14,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:51:14,498 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:51:14,498 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:51:14,504 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:51:14,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14 WrapperNode [2023-08-30 16:51:14,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:51:14,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:51:14,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:51:14,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:51:14,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,583 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-30 16:51:14,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:51:14,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:51:14,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:51:14,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:51:14,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,642 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:51:14,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:51:14,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:51:14,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:51:14,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (1/1) ... [2023-08-30 16:51:14,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:51:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:51:14,685 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-30 16:51:14,707 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-30 16:51:14,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:51:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:51:14,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:51:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:51:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:51:14,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:51:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:51:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:51:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:51:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:51:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:51:14,724 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:51:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:51:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:51:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:51:14,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:51:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:51:14,726 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:51:14,925 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:51:14,931 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:51:15,299 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:51:15,418 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:51:15,418 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:51:15,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:15 BoogieIcfgContainer [2023-08-30 16:51:15,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:51:15,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:51:15,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:51:15,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:51:15,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:51:13" (1/3) ... [2023-08-30 16:51:15,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f4fcb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:51:15, skipping insertion in model container [2023-08-30 16:51:15,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:51:14" (2/3) ... [2023-08-30 16:51:15,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f4fcb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:51:15, skipping insertion in model container [2023-08-30 16:51:15,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:15" (3/3) ... [2023-08-30 16:51:15,431 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-08-30 16:51:15,438 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:51:15,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:51:15,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:51:15,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:51:15,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:51:15,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 16:51:15,576 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 16:51:15,577 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:15,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:51:15,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 16:51:15,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:15,590 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:51:15,599 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:15,601 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:15,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-30 16:51:15,635 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 16:51:15,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:15,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:51:15,638 INFO L119 LiptonReduction]: Number of co-enabled transitions 3256 [2023-08-30 16:51:20,253 INFO L134 LiptonReduction]: Checked pairs total: 9032 [2023-08-30 16:51:20,253 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 16:51:20,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:51:20,282 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=true, 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;@2dfb1a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:51:20,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:51:20,299 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 16:51:20,299 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:51:20,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:20,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:51:20,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:20,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash 532873566, now seen corresponding path program 1 times [2023-08-30 16:51:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94038369] [2023-08-30 16:51:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:20,739 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-30 16:51:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94038369] [2023-08-30 16:51:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94038369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:20,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:20,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:51:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231368770] [2023-08-30 16:51:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:20,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:51:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:51:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:51:20,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-08-30 16:51:20,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:20,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:20,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-08-30 16:51:20,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:21,926 INFO L130 PetriNetUnfolder]: 4903/6853 cut-off events. [2023-08-30 16:51:21,926 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-30 16:51:21,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13701 conditions, 6853 events. 4903/6853 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34633 event pairs, 1733 based on Foata normal form. 0/6512 useless extension candidates. Maximal degree in co-relation 13689. Up to 5323 conditions per place. [2023-08-30 16:51:21,977 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-30 16:51:21,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 198 flow [2023-08-30 16:51:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-30 16:51:21,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377229080932785 [2023-08-30 16:51:21,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-30 16:51:21,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-30 16:51:22,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:22,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-30 16:51:22,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,015 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 392 transitions. [2023-08-30 16:51:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 198 flow [2023-08-30 16:51:22,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:51:22,023 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 16:51:22,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:51:22,029 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:51:22,030 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 16:51:22,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:22,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:22,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:51:22,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:22,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash -376863777, now seen corresponding path program 1 times [2023-08-30 16:51:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475865284] [2023-08-30 16:51:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:22,727 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-30 16:51:22,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:22,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475865284] [2023-08-30 16:51:22,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475865284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:22,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:22,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730175142] [2023-08-30 16:51:22,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:22,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:22,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:22,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:22,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 16:51:22,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:22,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:22,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 16:51:22,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:24,121 INFO L130 PetriNetUnfolder]: 8844/11946 cut-off events. [2023-08-30 16:51:24,121 INFO L131 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2023-08-30 16:51:24,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24793 conditions, 11946 events. 8844/11946 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 57351 event pairs, 1299 based on Foata normal form. 160/12105 useless extension candidates. Maximal degree in co-relation 24783. Up to 10168 conditions per place. [2023-08-30 16:51:24,237 INFO L137 encePairwiseOnDemand]: 230/243 looper letters, 44 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2023-08-30 16:51:24,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 254 flow [2023-08-30 16:51:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-30 16:51:24,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897119341563786 [2023-08-30 16:51:24,239 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-30 16:51:24,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-30 16:51:24,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:24,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-30 16:51:24,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:24,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:24,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:24,244 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 4 states and 476 transitions. [2023-08-30 16:51:24,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 254 flow [2023-08-30 16:51:24,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:24,247 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 155 flow [2023-08-30 16:51:24,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-08-30 16:51:24,247 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-30 16:51:24,248 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 155 flow [2023-08-30 16:51:24,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:24,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:24,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:24,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:51:24,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:24,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:24,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1202122654, now seen corresponding path program 1 times [2023-08-30 16:51:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491634269] [2023-08-30 16:51:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:24,659 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-30 16:51:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491634269] [2023-08-30 16:51:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491634269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475892668] [2023-08-30 16:51:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:24,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:24,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:24,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 16:51:24,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:24,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:24,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 16:51:24,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:25,982 INFO L130 PetriNetUnfolder]: 8265/11187 cut-off events. [2023-08-30 16:51:25,982 INFO L131 PetriNetUnfolder]: For 2885/2885 co-relation queries the response was YES. [2023-08-30 16:51:26,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31271 conditions, 11187 events. 8265/11187 cut-off events. For 2885/2885 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 53076 event pairs, 2319 based on Foata normal form. 160/11346 useless extension candidates. Maximal degree in co-relation 31259. Up to 7033 conditions per place. [2023-08-30 16:51:26,061 INFO L137 encePairwiseOnDemand]: 231/243 looper letters, 51 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2023-08-30 16:51:26,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 362 flow [2023-08-30 16:51:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-30 16:51:26,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835390946502058 [2023-08-30 16:51:26,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-30 16:51:26,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-30 16:51:26,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:26,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-30 16:51:26,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:26,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:26,068 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:26,068 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 155 flow. Second operand 4 states and 470 transitions. [2023-08-30 16:51:26,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 362 flow [2023-08-30 16:51:26,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:51:26,074 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 254 flow [2023-08-30 16:51:26,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-30 16:51:26,075 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-08-30 16:51:26,075 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 254 flow [2023-08-30 16:51:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:26,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:26,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:26,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:51:26,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:26,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1454752141, now seen corresponding path program 1 times [2023-08-30 16:51:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50013867] [2023-08-30 16:51:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:26,480 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-30 16:51:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50013867] [2023-08-30 16:51:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50013867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:26,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421540557] [2023-08-30 16:51:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:26,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:26,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:26,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:26,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-08-30 16:51:26,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:26,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:26,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-08-30 16:51:26,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:27,814 INFO L130 PetriNetUnfolder]: 8408/11833 cut-off events. [2023-08-30 16:51:27,814 INFO L131 PetriNetUnfolder]: For 9619/9695 co-relation queries the response was YES. [2023-08-30 16:51:27,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36964 conditions, 11833 events. 8408/11833 cut-off events. For 9619/9695 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 64618 event pairs, 1856 based on Foata normal form. 110/11469 useless extension candidates. Maximal degree in co-relation 36947. Up to 9697 conditions per place. [2023-08-30 16:51:27,883 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 62 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-08-30 16:51:27,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 522 flow [2023-08-30 16:51:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:51:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:51:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-30 16:51:27,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377229080932785 [2023-08-30 16:51:27,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-30 16:51:27,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-30 16:51:27,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:27,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-30 16:51:27,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:27,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:27,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:27,889 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 254 flow. Second operand 3 states and 392 transitions. [2023-08-30 16:51:27,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 522 flow [2023-08-30 16:51:27,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 511 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:27,911 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 293 flow [2023-08-30 16:51:27,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-08-30 16:51:27,912 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-30 16:51:27,912 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 293 flow [2023-08-30 16:51:27,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:27,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:27,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:27,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:51:27,914 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:27,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2145966666, now seen corresponding path program 1 times [2023-08-30 16:51:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607090707] [2023-08-30 16:51:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:28,397 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-30 16:51:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607090707] [2023-08-30 16:51:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607090707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:28,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:28,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187050699] [2023-08-30 16:51:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:28,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:28,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-08-30 16:51:28,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:28,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:28,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-08-30 16:51:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:29,669 INFO L130 PetriNetUnfolder]: 8936/12565 cut-off events. [2023-08-30 16:51:29,669 INFO L131 PetriNetUnfolder]: For 10105/10290 co-relation queries the response was YES. [2023-08-30 16:51:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40134 conditions, 12565 events. 8936/12565 cut-off events. For 10105/10290 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 68885 event pairs, 1908 based on Foata normal form. 245/12320 useless extension candidates. Maximal degree in co-relation 40116. Up to 9610 conditions per place. [2023-08-30 16:51:29,739 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 79 selfloop transitions, 14 changer transitions 0/101 dead transitions. [2023-08-30 16:51:29,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 715 flow [2023-08-30 16:51:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-30 16:51:29,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2023-08-30 16:51:29,742 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-30 16:51:29,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-30 16:51:29,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:29,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-30 16:51:29,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:29,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:29,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:29,747 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 293 flow. Second operand 4 states and 516 transitions. [2023-08-30 16:51:29,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 715 flow [2023-08-30 16:51:29,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:29,769 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 405 flow [2023-08-30 16:51:29,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2023-08-30 16:51:29,770 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-30 16:51:29,770 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 405 flow [2023-08-30 16:51:29,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:29,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:29,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:51:29,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:29,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1561558364, now seen corresponding path program 1 times [2023-08-30 16:51:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:29,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352805088] [2023-08-30 16:51:29,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:30,107 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-30 16:51:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352805088] [2023-08-30 16:51:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352805088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:30,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:51:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602545904] [2023-08-30 16:51:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:30,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:30,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 243 [2023-08-30 16:51:30,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:30,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:30,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 243 [2023-08-30 16:51:30,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:31,405 INFO L130 PetriNetUnfolder]: 9046/12754 cut-off events. [2023-08-30 16:51:31,406 INFO L131 PetriNetUnfolder]: For 16897/17109 co-relation queries the response was YES. [2023-08-30 16:51:31,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45014 conditions, 12754 events. 9046/12754 cut-off events. For 16897/17109 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 70333 event pairs, 1296 based on Foata normal form. 222/12591 useless extension candidates. Maximal degree in co-relation 44994. Up to 9194 conditions per place. [2023-08-30 16:51:31,475 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 86 selfloop transitions, 22 changer transitions 0/116 dead transitions. [2023-08-30 16:51:31,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 116 transitions, 929 flow [2023-08-30 16:51:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-30 16:51:31,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360082304526749 [2023-08-30 16:51:31,477 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-30 16:51:31,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-30 16:51:31,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:31,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-30 16:51:31,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:31,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:31,481 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:31,481 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 405 flow. Second operand 4 states and 521 transitions. [2023-08-30 16:51:31,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 116 transitions, 929 flow [2023-08-30 16:51:31,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 911 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:31,507 INFO L231 Difference]: Finished difference. Result has 54 places, 74 transitions, 579 flow [2023-08-30 16:51:31,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=579, PETRI_PLACES=54, PETRI_TRANSITIONS=74} [2023-08-30 16:51:31,508 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-30 16:51:31,508 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 74 transitions, 579 flow [2023-08-30 16:51:31,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:31,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:31,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:31,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:51:31,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:31,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1564058204, now seen corresponding path program 2 times [2023-08-30 16:51:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:31,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062798966] [2023-08-30 16:51:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:32,033 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-30 16:51:32,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:32,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062798966] [2023-08-30 16:51:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062798966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076601183] [2023-08-30 16:51:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:32,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:32,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 243 [2023-08-30 16:51:32,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 74 transitions, 579 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:32,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:32,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 243 [2023-08-30 16:51:32,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:33,281 INFO L130 PetriNetUnfolder]: 9123/12835 cut-off events. [2023-08-30 16:51:33,281 INFO L131 PetriNetUnfolder]: For 26338/26790 co-relation queries the response was YES. [2023-08-30 16:51:33,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49742 conditions, 12835 events. 9123/12835 cut-off events. For 26338/26790 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 70555 event pairs, 1344 based on Foata normal form. 425/12829 useless extension candidates. Maximal degree in co-relation 49721. Up to 9289 conditions per place. [2023-08-30 16:51:33,352 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 88 selfloop transitions, 30 changer transitions 0/126 dead transitions. [2023-08-30 16:51:33,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 1140 flow [2023-08-30 16:51:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-30 16:51:33,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360082304526749 [2023-08-30 16:51:33,355 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-30 16:51:33,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-30 16:51:33,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:33,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-30 16:51:33,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,359 INFO L175 Difference]: Start difference. First operand has 54 places, 74 transitions, 579 flow. Second operand 4 states and 521 transitions. [2023-08-30 16:51:33,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 1140 flow [2023-08-30 16:51:33,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 1111 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:33,392 INFO L231 Difference]: Finished difference. Result has 57 places, 85 transitions, 762 flow [2023-08-30 16:51:33,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=762, PETRI_PLACES=57, PETRI_TRANSITIONS=85} [2023-08-30 16:51:33,393 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-30 16:51:33,394 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 85 transitions, 762 flow [2023-08-30 16:51:33,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:33,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:33,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:33,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:51:33,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:33,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1199061782, now seen corresponding path program 1 times [2023-08-30 16:51:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104038796] [2023-08-30 16:51:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:34,041 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-30 16:51:34,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104038796] [2023-08-30 16:51:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104038796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80765713] [2023-08-30 16:51:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:34,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:34,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-08-30 16:51:34,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 85 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:34,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:34,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-08-30 16:51:34,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:35,312 INFO L130 PetriNetUnfolder]: 9560/13354 cut-off events. [2023-08-30 16:51:35,312 INFO L131 PetriNetUnfolder]: For 39916/40607 co-relation queries the response was YES. [2023-08-30 16:51:35,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54308 conditions, 13354 events. 9560/13354 cut-off events. For 39916/40607 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 70873 event pairs, 2151 based on Foata normal form. 696/13746 useless extension candidates. Maximal degree in co-relation 54285. Up to 9679 conditions per place. [2023-08-30 16:51:35,387 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 98 selfloop transitions, 40 changer transitions 0/146 dead transitions. [2023-08-30 16:51:35,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 146 transitions, 1409 flow [2023-08-30 16:51:35,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-30 16:51:35,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275720164609053 [2023-08-30 16:51:35,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-30 16:51:35,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-30 16:51:35,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:35,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-30 16:51:35,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:35,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:35,396 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:35,396 INFO L175 Difference]: Start difference. First operand has 57 places, 85 transitions, 762 flow. Second operand 5 states and 641 transitions. [2023-08-30 16:51:35,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 146 transitions, 1409 flow [2023-08-30 16:51:35,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 146 transitions, 1376 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:35,438 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 963 flow [2023-08-30 16:51:35,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=963, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2023-08-30 16:51:35,438 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-30 16:51:35,439 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 963 flow [2023-08-30 16:51:35,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:35,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:35,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:35,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:51:35,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:35,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1163671237, now seen corresponding path program 1 times [2023-08-30 16:51:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789809048] [2023-08-30 16:51:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:35,900 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-30 16:51:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789809048] [2023-08-30 16:51:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789809048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790578256] [2023-08-30 16:51:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:35,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:35,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:35,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-08-30 16:51:35,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 95 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:35,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:35,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-08-30 16:51:35,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:37,457 INFO L130 PetriNetUnfolder]: 10241/14238 cut-off events. [2023-08-30 16:51:37,458 INFO L131 PetriNetUnfolder]: For 57737/58758 co-relation queries the response was YES. [2023-08-30 16:51:37,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61399 conditions, 14238 events. 10241/14238 cut-off events. For 57737/58758 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 76122 event pairs, 2515 based on Foata normal form. 850/14750 useless extension candidates. Maximal degree in co-relation 61374. Up to 10099 conditions per place. [2023-08-30 16:51:37,561 INFO L137 encePairwiseOnDemand]: 234/243 looper letters, 112 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2023-08-30 16:51:37,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 161 transitions, 1684 flow [2023-08-30 16:51:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:37,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-30 16:51:37,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234567901234568 [2023-08-30 16:51:37,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-30 16:51:37,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-30 16:51:37,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:37,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-30 16:51:37,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:37,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:37,569 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:37,569 INFO L175 Difference]: Start difference. First operand has 61 places, 95 transitions, 963 flow. Second operand 5 states and 636 transitions. [2023-08-30 16:51:37,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 161 transitions, 1684 flow [2023-08-30 16:51:37,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 161 transitions, 1594 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:37,622 INFO L231 Difference]: Finished difference. Result has 63 places, 106 transitions, 1124 flow [2023-08-30 16:51:37,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1124, PETRI_PLACES=63, PETRI_TRANSITIONS=106} [2023-08-30 16:51:37,623 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-08-30 16:51:37,624 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 106 transitions, 1124 flow [2023-08-30 16:51:37,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:37,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:37,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:37,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:51:37,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:37,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1241166277, now seen corresponding path program 2 times [2023-08-30 16:51:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365954110] [2023-08-30 16:51:37,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:38,174 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-30 16:51:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365954110] [2023-08-30 16:51:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365954110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:38,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322815633] [2023-08-30 16:51:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:38,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:38,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-08-30 16:51:38,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 106 transitions, 1124 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:38,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:38,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-08-30 16:51:38,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:39,899 INFO L130 PetriNetUnfolder]: 11755/16361 cut-off events. [2023-08-30 16:51:39,899 INFO L131 PetriNetUnfolder]: For 82054/83124 co-relation queries the response was YES. [2023-08-30 16:51:39,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74868 conditions, 16361 events. 11755/16361 cut-off events. For 82054/83124 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 90736 event pairs, 1955 based on Foata normal form. 923/16721 useless extension candidates. Maximal degree in co-relation 74842. Up to 11017 conditions per place. [2023-08-30 16:51:40,022 INFO L137 encePairwiseOnDemand]: 234/243 looper letters, 142 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2023-08-30 16:51:40,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 194 transitions, 2224 flow [2023-08-30 16:51:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-30 16:51:40,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275720164609053 [2023-08-30 16:51:40,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-30 16:51:40,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-30 16:51:40,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:40,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-30 16:51:40,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,031 INFO L175 Difference]: Start difference. First operand has 63 places, 106 transitions, 1124 flow. Second operand 5 states and 641 transitions. [2023-08-30 16:51:40,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 194 transitions, 2224 flow [2023-08-30 16:51:40,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 194 transitions, 2061 flow, removed 42 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:40,200 INFO L231 Difference]: Finished difference. Result has 66 places, 131 transitions, 1495 flow [2023-08-30 16:51:40,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1495, PETRI_PLACES=66, PETRI_TRANSITIONS=131} [2023-08-30 16:51:40,201 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-30 16:51:40,201 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 131 transitions, 1495 flow [2023-08-30 16:51:40,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:40,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:40,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:51:40,202 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:40,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1792374716, now seen corresponding path program 1 times [2023-08-30 16:51:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482079045] [2023-08-30 16:51:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:40,749 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-30 16:51:40,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482079045] [2023-08-30 16:51:40,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482079045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:40,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:40,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263327924] [2023-08-30 16:51:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:40,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-08-30 16:51:40,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 131 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:40,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:40,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-08-30 16:51:40,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:42,294 INFO L130 PetriNetUnfolder]: 13089/18191 cut-off events. [2023-08-30 16:51:42,295 INFO L131 PetriNetUnfolder]: For 122595/124106 co-relation queries the response was YES. [2023-08-30 16:51:42,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91309 conditions, 18191 events. 13089/18191 cut-off events. For 122595/124106 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 102498 event pairs, 2046 based on Foata normal form. 1325/18964 useless extension candidates. Maximal degree in co-relation 91281. Up to 11124 conditions per place. [2023-08-30 16:51:42,439 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 136 selfloop transitions, 65 changer transitions 0/209 dead transitions. [2023-08-30 16:51:42,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 2519 flow [2023-08-30 16:51:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-30 16:51:42,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212620027434842 [2023-08-30 16:51:42,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-30 16:51:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-30 16:51:42,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:42,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-30 16:51:42,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,447 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,447 INFO L175 Difference]: Start difference. First operand has 66 places, 131 transitions, 1495 flow. Second operand 6 states and 760 transitions. [2023-08-30 16:51:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 2519 flow [2023-08-30 16:51:42,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 209 transitions, 2390 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-30 16:51:42,733 INFO L231 Difference]: Finished difference. Result has 70 places, 142 transitions, 1752 flow [2023-08-30 16:51:42,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1752, PETRI_PLACES=70, PETRI_TRANSITIONS=142} [2023-08-30 16:51:42,733 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-08-30 16:51:42,734 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 142 transitions, 1752 flow [2023-08-30 16:51:42,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:42,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:42,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:51:42,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:42,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash 689555593, now seen corresponding path program 1 times [2023-08-30 16:51:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:42,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152248257] [2023-08-30 16:51:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:42,908 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-30 16:51:42,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152248257] [2023-08-30 16:51:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152248257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:42,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271522184] [2023-08-30 16:51:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:42,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:42,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 16:51:42,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 142 transitions, 1752 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:42,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:42,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 16:51:42,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:43,700 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:43,701 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:43,701 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,701 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,702 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,702 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,702 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,702 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,702 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,702 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,703 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,703 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:43,933 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:43,933 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,933 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,933 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,933 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:43,934 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,934 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,934 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,934 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][167], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:43,935 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,935 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,935 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,935 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][259], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,936 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][204], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,936 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,936 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,937 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,937 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,937 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,937 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,937 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,938 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][256], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,938 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,938 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,939 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,939 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,939 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,939 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,939 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,939 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:43,939 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,939 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,940 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:43,940 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:44,043 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][300], [60#L786true, Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:44,043 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,043 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,043 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,043 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][259], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:44,044 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][204], [60#L786true, Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:44,044 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,044 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,084 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:44,084 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,084 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,084 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,084 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:44,085 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,085 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,085 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,085 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,086 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][256], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:44,086 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,086 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,086 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,086 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:44,517 INFO L130 PetriNetUnfolder]: 10720/14795 cut-off events. [2023-08-30 16:51:44,517 INFO L131 PetriNetUnfolder]: For 175017/179260 co-relation queries the response was YES. [2023-08-30 16:51:44,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82854 conditions, 14795 events. 10720/14795 cut-off events. For 175017/179260 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 83716 event pairs, 1415 based on Foata normal form. 3230/17264 useless extension candidates. Maximal degree in co-relation 82825. Up to 9327 conditions per place. [2023-08-30 16:51:44,615 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 348 selfloop transitions, 10 changer transitions 4/374 dead transitions. [2023-08-30 16:51:44,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 374 transitions, 5478 flow [2023-08-30 16:51:44,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:51:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:51:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-30 16:51:44,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160493827160494 [2023-08-30 16:51:44,618 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-30 16:51:44,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-30 16:51:44,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:44,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-30 16:51:44,620 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-30 16:51:44,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,622 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,622 INFO L175 Difference]: Start difference. First operand has 70 places, 142 transitions, 1752 flow. Second operand 5 states and 627 transitions. [2023-08-30 16:51:44,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 374 transitions, 5478 flow [2023-08-30 16:51:44,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 374 transitions, 5160 flow, removed 133 selfloop flow, removed 3 redundant places. [2023-08-30 16:51:44,764 INFO L231 Difference]: Finished difference. Result has 74 places, 141 transitions, 1614 flow [2023-08-30 16:51:44,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1614, PETRI_PLACES=74, PETRI_TRANSITIONS=141} [2023-08-30 16:51:44,765 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-30 16:51:44,765 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 141 transitions, 1614 flow [2023-08-30 16:51:44,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:44,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:44,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:51:44,766 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:44,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash -312344570, now seen corresponding path program 1 times [2023-08-30 16:51:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526637843] [2023-08-30 16:51:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:44,939 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-30 16:51:44,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526637843] [2023-08-30 16:51:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526637843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:44,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:44,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432054105] [2023-08-30 16:51:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:44,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:44,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 16:51:44,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 141 transitions, 1614 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:44,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:44,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 16:51:44,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:45,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:45,680 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,680 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,680 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,680 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:45,681 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,681 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,681 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,682 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,682 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,682 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,682 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:45,834 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:45,834 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,834 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,834 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,834 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][168], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:45,835 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 16:51:45,835 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,835 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,836 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,836 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,836 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,836 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,837 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,837 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,838 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,838 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,839 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,839 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,839 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,839 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][263], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,840 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,840 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,840 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,840 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,841 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,841 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,841 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,841 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,842 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,842 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,842 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,842 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,843 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,843 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,844 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,844 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:45,931 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][310], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,931 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,931 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,931 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,932 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,932 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,933 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,933 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,933 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,933 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,933 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][310], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,934 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,934 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,934 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,934 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,935 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 16:51:45,935 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,935 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:45,936 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:46,250 INFO L130 PetriNetUnfolder]: 8627/12033 cut-off events. [2023-08-30 16:51:46,251 INFO L131 PetriNetUnfolder]: For 126328/130244 co-relation queries the response was YES. [2023-08-30 16:51:46,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68576 conditions, 12033 events. 8627/12033 cut-off events. For 126328/130244 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 67523 event pairs, 705 based on Foata normal form. 2608/13985 useless extension candidates. Maximal degree in co-relation 68544. Up to 7266 conditions per place. [2023-08-30 16:51:46,327 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 407 selfloop transitions, 19 changer transitions 19/457 dead transitions. [2023-08-30 16:51:46,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 457 transitions, 6327 flow [2023-08-30 16:51:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:51:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:51:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-30 16:51:46,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173427395649618 [2023-08-30 16:51:46,330 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-30 16:51:46,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-30 16:51:46,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:46,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-30 16:51:46,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,336 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,336 INFO L175 Difference]: Start difference. First operand has 74 places, 141 transitions, 1614 flow. Second operand 7 states and 880 transitions. [2023-08-30 16:51:46,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 457 transitions, 6327 flow [2023-08-30 16:51:46,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 457 transitions, 6322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:51:46,525 INFO L231 Difference]: Finished difference. Result has 82 places, 138 transitions, 1599 flow [2023-08-30 16:51:46,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1599, PETRI_PLACES=82, PETRI_TRANSITIONS=138} [2023-08-30 16:51:46,526 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-30 16:51:46,526 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 138 transitions, 1599 flow [2023-08-30 16:51:46,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:46,527 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-30 16:51:46,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:51:46,527 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:46,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1713990753, now seen corresponding path program 1 times [2023-08-30 16:51:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846735870] [2023-08-30 16:51:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:46,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:46,728 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-30 16:51:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846735870] [2023-08-30 16:51:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846735870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:51:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198003040] [2023-08-30 16:51:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:46,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:51:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:51:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:51:46,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 16:51:46,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 138 transitions, 1599 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:46,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:46,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 16:51:46,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:47,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,464 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,464 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,464 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,464 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,465 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,465 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,465 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,465 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 16:51:47,465 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 16:51:47,466 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,466 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 16:51:47,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,629 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,629 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,629 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,629 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][169], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,630 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,630 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,630 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,630 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,631 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,632 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,632 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,632 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,632 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,632 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,633 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,633 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,633 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,634 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,634 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 16:51:47,635 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][265], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 16:51:47,636 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, 260#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 16:51:47,637 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,638 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,639 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,639 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 16:51:47,734 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][312], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,734 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,734 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,734 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,734 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,735 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,735 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,735 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][312], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,736 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,736 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,737 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 16:51:47,737 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:47,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 16:51:48,016 INFO L130 PetriNetUnfolder]: 8104/11219 cut-off events. [2023-08-30 16:51:48,016 INFO L131 PetriNetUnfolder]: For 124594/128382 co-relation queries the response was YES. [2023-08-30 16:51:48,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67368 conditions, 11219 events. 8104/11219 cut-off events. For 124594/128382 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 62265 event pairs, 568 based on Foata normal form. 2078/12663 useless extension candidates. Maximal degree in co-relation 67332. Up to 6679 conditions per place. [2023-08-30 16:51:48,097 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 413 selfloop transitions, 28 changer transitions 34/487 dead transitions. [2023-08-30 16:51:48,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 487 transitions, 6767 flow [2023-08-30 16:51:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:51:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:51:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1131 transitions. [2023-08-30 16:51:48,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171467764060357 [2023-08-30 16:51:48,100 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1131 transitions. [2023-08-30 16:51:48,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1131 transitions. [2023-08-30 16:51:48,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:48,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1131 transitions. [2023-08-30 16:51:48,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,107 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,107 INFO L175 Difference]: Start difference. First operand has 82 places, 138 transitions, 1599 flow. Second operand 9 states and 1131 transitions. [2023-08-30 16:51:48,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 487 transitions, 6767 flow [2023-08-30 16:51:48,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 487 transitions, 6330 flow, removed 129 selfloop flow, removed 6 redundant places. [2023-08-30 16:51:48,559 INFO L231 Difference]: Finished difference. Result has 87 places, 140 transitions, 1550 flow [2023-08-30 16:51:48,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1550, PETRI_PLACES=87, PETRI_TRANSITIONS=140} [2023-08-30 16:51:48,559 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-08-30 16:51:48,559 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 140 transitions, 1550 flow [2023-08-30 16:51:48,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:48,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:48,560 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-30 16:51:48,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:51:48,560 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:48,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1562489526, now seen corresponding path program 1 times [2023-08-30 16:51:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34658725] [2023-08-30 16:51:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:49,229 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-30 16:51:49,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:49,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34658725] [2023-08-30 16:51:49,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34658725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:49,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:49,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:51:49,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514066666] [2023-08-30 16:51:49,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:49,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:51:49,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:51:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:51:49,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 243 [2023-08-30 16:51:49,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 140 transitions, 1550 flow. Second operand has 8 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:49,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:49,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 243 [2023-08-30 16:51:49,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:51,829 INFO L130 PetriNetUnfolder]: 14705/20962 cut-off events. [2023-08-30 16:51:51,830 INFO L131 PetriNetUnfolder]: For 115665/115665 co-relation queries the response was YES. [2023-08-30 16:51:51,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113817 conditions, 20962 events. 14705/20962 cut-off events. For 115665/115665 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 122830 event pairs, 1765 based on Foata normal form. 13/20975 useless extension candidates. Maximal degree in co-relation 113780. Up to 10215 conditions per place. [2023-08-30 16:51:51,924 INFO L137 encePairwiseOnDemand]: 228/243 looper letters, 189 selfloop transitions, 131 changer transitions 259/579 dead transitions. [2023-08-30 16:51:51,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 579 transitions, 6890 flow [2023-08-30 16:51:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 16:51:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 16:51:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1612 transitions. [2023-08-30 16:51:51,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738389182833627 [2023-08-30 16:51:51,930 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1612 transitions. [2023-08-30 16:51:51,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1612 transitions. [2023-08-30 16:51:51,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:51,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1612 transitions. [2023-08-30 16:51:51,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.14285714285714) internal successors, (1612), 14 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:51,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 243.0) internal successors, (3645), 15 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:51,939 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 243.0) internal successors, (3645), 15 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:51,939 INFO L175 Difference]: Start difference. First operand has 87 places, 140 transitions, 1550 flow. Second operand 14 states and 1612 transitions. [2023-08-30 16:51:51,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 579 transitions, 6890 flow [2023-08-30 16:51:53,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 579 transitions, 6165 flow, removed 232 selfloop flow, removed 4 redundant places. [2023-08-30 16:51:53,041 INFO L231 Difference]: Finished difference. Result has 105 places, 193 transitions, 2534 flow [2023-08-30 16:51:53,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2534, PETRI_PLACES=105, PETRI_TRANSITIONS=193} [2023-08-30 16:51:53,042 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2023-08-30 16:51:53,042 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 193 transitions, 2534 flow [2023-08-30 16:51:53,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:53,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:53,042 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-30 16:51:53,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:51:53,042 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:53,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1468939936, now seen corresponding path program 2 times [2023-08-30 16:51:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:53,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6889436] [2023-08-30 16:51:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:53,294 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-30 16:51:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6889436] [2023-08-30 16:51:53,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6889436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:51:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634862596] [2023-08-30 16:51:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:53,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:51:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:53,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:51:53,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:51:53,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 16:51:53,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 193 transitions, 2534 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:53,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:53,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 16:51:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:54,165 INFO L130 PetriNetUnfolder]: 3995/5818 cut-off events. [2023-08-30 16:51:54,166 INFO L131 PetriNetUnfolder]: For 49265/50213 co-relation queries the response was YES. [2023-08-30 16:51:54,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34227 conditions, 5818 events. 3995/5818 cut-off events. For 49265/50213 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31356 event pairs, 468 based on Foata normal form. 423/5965 useless extension candidates. Maximal degree in co-relation 34180. Up to 3466 conditions per place. [2023-08-30 16:51:54,196 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 253 selfloop transitions, 18 changer transitions 85/378 dead transitions. [2023-08-30 16:51:54,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 378 transitions, 5596 flow [2023-08-30 16:51:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:51:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:51:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 979 transitions. [2023-08-30 16:51:54,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036008230452675 [2023-08-30 16:51:54,199 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 979 transitions. [2023-08-30 16:51:54,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 979 transitions. [2023-08-30 16:51:54,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:54,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 979 transitions. [2023-08-30 16:51:54,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:54,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:54,204 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:54,204 INFO L175 Difference]: Start difference. First operand has 105 places, 193 transitions, 2534 flow. Second operand 8 states and 979 transitions. [2023-08-30 16:51:54,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 378 transitions, 5596 flow [2023-08-30 16:51:54,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 378 transitions, 5234 flow, removed 155 selfloop flow, removed 8 redundant places. [2023-08-30 16:51:54,324 INFO L231 Difference]: Finished difference. Result has 99 places, 151 transitions, 1817 flow [2023-08-30 16:51:54,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1817, PETRI_PLACES=99, PETRI_TRANSITIONS=151} [2023-08-30 16:51:54,325 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2023-08-30 16:51:54,325 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 151 transitions, 1817 flow [2023-08-30 16:51:54,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:54,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:54,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:54,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:51:54,326 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:54,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1043029499, now seen corresponding path program 1 times [2023-08-30 16:51:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331483677] [2023-08-30 16:51:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:54,710 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-30 16:51:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331483677] [2023-08-30 16:51:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331483677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:51:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980624012] [2023-08-30 16:51:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:54,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:51:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:51:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:51:54,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 243 [2023-08-30 16:51:54,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 151 transitions, 1817 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:54,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:54,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 243 [2023-08-30 16:51:54,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:55,724 INFO L130 PetriNetUnfolder]: 4391/6697 cut-off events. [2023-08-30 16:51:55,724 INFO L131 PetriNetUnfolder]: For 36535/36970 co-relation queries the response was YES. [2023-08-30 16:51:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37460 conditions, 6697 events. 4391/6697 cut-off events. For 36535/36970 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38686 event pairs, 482 based on Foata normal form. 271/6949 useless extension candidates. Maximal degree in co-relation 37427. Up to 3347 conditions per place. [2023-08-30 16:51:55,751 INFO L137 encePairwiseOnDemand]: 230/243 looper letters, 117 selfloop transitions, 54 changer transitions 126/301 dead transitions. [2023-08-30 16:51:55,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 301 transitions, 3958 flow [2023-08-30 16:51:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:51:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:51:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2023-08-30 16:51:55,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48010973936899864 [2023-08-30 16:51:55,754 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2023-08-30 16:51:55,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2023-08-30 16:51:55,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:55,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2023-08-30 16:51:55,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,759 INFO L175 Difference]: Start difference. First operand has 99 places, 151 transitions, 1817 flow. Second operand 6 states and 700 transitions. [2023-08-30 16:51:55,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 301 transitions, 3958 flow [2023-08-30 16:51:55,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 301 transitions, 3759 flow, removed 42 selfloop flow, removed 9 redundant places. [2023-08-30 16:51:55,889 INFO L231 Difference]: Finished difference. Result has 97 places, 124 transitions, 1538 flow [2023-08-30 16:51:55,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1538, PETRI_PLACES=97, PETRI_TRANSITIONS=124} [2023-08-30 16:51:55,889 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2023-08-30 16:51:55,889 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 124 transitions, 1538 flow [2023-08-30 16:51:55,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:55,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:55,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:51:55,890 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:55,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1899330447, now seen corresponding path program 2 times [2023-08-30 16:51:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547080902] [2023-08-30 16:51:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:56,276 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-30 16:51:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:56,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547080902] [2023-08-30 16:51:56,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547080902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:56,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:56,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:51:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617691480] [2023-08-30 16:51:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:56,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:51:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:51:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:51:56,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 16:51:56,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 124 transitions, 1538 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-30 16:51:56,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:56,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 16:51:56,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:51:56,987 INFO L130 PetriNetUnfolder]: 4456/7053 cut-off events. [2023-08-30 16:51:56,987 INFO L131 PetriNetUnfolder]: For 38038/38372 co-relation queries the response was YES. [2023-08-30 16:51:57,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38253 conditions, 7053 events. 4456/7053 cut-off events. For 38038/38372 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 43575 event pairs, 1300 based on Foata normal form. 229/7251 useless extension candidates. Maximal degree in co-relation 38210. Up to 3631 conditions per place. [2023-08-30 16:51:57,019 INFO L137 encePairwiseOnDemand]: 238/243 looper letters, 57 selfloop transitions, 5 changer transitions 118/182 dead transitions. [2023-08-30 16:51:57,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 2379 flow [2023-08-30 16:51:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:51:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:51:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-30 16:51:57,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2023-08-30 16:51:57,021 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-30 16:51:57,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-30 16:51:57,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:51:57,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-30 16:51:57,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:57,024 INFO L175 Difference]: Start difference. First operand has 97 places, 124 transitions, 1538 flow. Second operand 4 states and 471 transitions. [2023-08-30 16:51:57,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 2379 flow [2023-08-30 16:51:57,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 182 transitions, 2259 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 16:51:57,213 INFO L231 Difference]: Finished difference. Result has 94 places, 52 transitions, 392 flow [2023-08-30 16:51:57,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=94, PETRI_TRANSITIONS=52} [2023-08-30 16:51:57,213 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-08-30 16:51:57,213 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 52 transitions, 392 flow [2023-08-30 16:51:57,214 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-30 16:51:57,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:51:57,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:51:57,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 16:51:57,214 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:51:57,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:51:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash -243540721, now seen corresponding path program 3 times [2023-08-30 16:51:57,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:51:57,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184995021] [2023-08-30 16:51:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:51:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:51:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:51:59,191 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-30 16:51:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:51:59,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184995021] [2023-08-30 16:51:59,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184995021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:51:59,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:51:59,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:51:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838798301] [2023-08-30 16:51:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:51:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:51:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:51:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:51:59,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:51:59,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 243 [2023-08-30 16:51:59,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 52 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 100.8) internal successors, (1008), 10 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:51:59,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:51:59,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 243 [2023-08-30 16:51:59,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:00,346 INFO L130 PetriNetUnfolder]: 1484/2415 cut-off events. [2023-08-30 16:52:00,346 INFO L131 PetriNetUnfolder]: For 8761/8761 co-relation queries the response was YES. [2023-08-30 16:52:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11426 conditions, 2415 events. 1484/2415 cut-off events. For 8761/8761 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11979 event pairs, 150 based on Foata normal form. 1/2416 useless extension candidates. Maximal degree in co-relation 11400. Up to 1009 conditions per place. [2023-08-30 16:52:00,359 INFO L137 encePairwiseOnDemand]: 233/243 looper letters, 94 selfloop transitions, 20 changer transitions 26/140 dead transitions. [2023-08-30 16:52:00,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 140 transitions, 1256 flow [2023-08-30 16:52:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:52:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:52:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-08-30 16:52:00,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448559670781893 [2023-08-30 16:52:00,362 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-08-30 16:52:00,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-08-30 16:52:00,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:00,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-08-30 16:52:00,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:00,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:00,366 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:00,366 INFO L175 Difference]: Start difference. First operand has 94 places, 52 transitions, 392 flow. Second operand 8 states and 872 transitions. [2023-08-30 16:52:00,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 140 transitions, 1256 flow [2023-08-30 16:52:00,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 1058 flow, removed 49 selfloop flow, removed 22 redundant places. [2023-08-30 16:52:00,523 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 410 flow [2023-08-30 16:52:00,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-08-30 16:52:00,524 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-08-30 16:52:00,524 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 410 flow [2023-08-30 16:52:00,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.8) internal successors, (1008), 10 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:00,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:00,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:00,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 16:52:00,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:00,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -488113921, now seen corresponding path program 4 times [2023-08-30 16:52:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492228245] [2023-08-30 16:52:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:52:01,847 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-30 16:52:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:52:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492228245] [2023-08-30 16:52:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492228245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:52:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:52:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:52:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037449580] [2023-08-30 16:52:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:52:01,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:52:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:52:01,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:52:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:52:01,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-08-30 16:52:01,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 410 flow. Second operand has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:01,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:52:01,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-08-30 16:52:01,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:52:02,383 INFO L130 PetriNetUnfolder]: 1506/2471 cut-off events. [2023-08-30 16:52:02,383 INFO L131 PetriNetUnfolder]: For 7110/7115 co-relation queries the response was YES. [2023-08-30 16:52:02,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10715 conditions, 2471 events. 1506/2471 cut-off events. For 7110/7115 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12329 event pairs, 210 based on Foata normal form. 1/2461 useless extension candidates. Maximal degree in co-relation 10696. Up to 866 conditions per place. [2023-08-30 16:52:02,391 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 82 selfloop transitions, 8 changer transitions 64/157 dead transitions. [2023-08-30 16:52:02,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 157 transitions, 1305 flow [2023-08-30 16:52:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:52:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:52:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2023-08-30 16:52:02,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2023-08-30 16:52:02,393 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2023-08-30 16:52:02,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2023-08-30 16:52:02,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:52:02,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2023-08-30 16:52:02,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:02,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:02,397 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:02,397 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 410 flow. Second operand 7 states and 864 transitions. [2023-08-30 16:52:02,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 157 transitions, 1305 flow [2023-08-30 16:52:02,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 1300 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 16:52:02,422 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 448 flow [2023-08-30 16:52:02,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=77, PETRI_TRANSITIONS=58} [2023-08-30 16:52:02,423 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-08-30 16:52:02,423 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 448 flow [2023-08-30 16:52:02,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:52:02,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:52:02,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:02,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 16:52:02,424 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:52:02,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:52:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -909790857, now seen corresponding path program 5 times [2023-08-30 16:52:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:52:02,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902180443] [2023-08-30 16:52:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:52:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:52:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:52:02,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:52:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:52:02,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:52:02,528 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:52:02,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:52:02,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:52:02,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:52:02,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:52:02,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:52:02,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:52:02,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:52:02,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 16:52:02,531 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:52:02,536 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:52:02,537 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:52:02,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:52:02 BasicIcfg [2023-08-30 16:52:02,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:52:02,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:52:02,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:52:02,609 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:52:02,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:51:15" (3/4) ... [2023-08-30 16:52:02,611 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:52:02,685 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:52:02,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:52:02,686 INFO L158 Benchmark]: Toolchain (without parser) took 48738.79ms. Allocated memory was 62.9MB in the beginning and 3.6GB in the end (delta: 3.6GB). Free memory was 38.4MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 16:52:02,686 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 30.5MB in the beginning and 30.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:52:02,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.05ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 29.7MB in the end (delta: 8.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:52:02,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.87ms. Allocated memory is still 62.9MB. Free memory was 29.4MB in the beginning and 26.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:52:02,687 INFO L158 Benchmark]: Boogie Preprocessor took 69.47ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 26.7MB in the beginning and 53.1MB in the end (delta: -26.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2023-08-30 16:52:02,687 INFO L158 Benchmark]: RCFGBuilder took 765.23ms. Allocated memory is still 75.5MB. Free memory was 53.1MB in the beginning and 33.5MB in the end (delta: 19.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2023-08-30 16:52:02,687 INFO L158 Benchmark]: TraceAbstraction took 47186.57ms. Allocated memory was 75.5MB in the beginning and 3.6GB in the end (delta: 3.6GB). Free memory was 32.8MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 16:52:02,688 INFO L158 Benchmark]: Witness Printer took 76.66ms. Allocated memory is still 3.6GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:52:02,690 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 30.5MB in the beginning and 30.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.05ms. Allocated memory is still 62.9MB. Free memory was 38.2MB in the beginning and 29.7MB in the end (delta: 8.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.87ms. Allocated memory is still 62.9MB. Free memory was 29.4MB in the beginning and 26.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.47ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 26.7MB in the beginning and 53.1MB in the end (delta: -26.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * RCFGBuilder took 765.23ms. Allocated memory is still 75.5MB. Free memory was 53.1MB in the beginning and 33.5MB in the end (delta: 19.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 47186.57ms. Allocated memory was 75.5MB in the beginning and 3.6GB in the end (delta: 3.6GB). Free memory was 32.8MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 76.66ms. Allocated memory is still 3.6GB. Free memory was 2.6GB in the beginning and 2.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 30 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 9032 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3585, independent: 3344, independent conditional: 0, independent unconditional: 3344, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1760, independent: 1717, independent conditional: 0, independent unconditional: 1717, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3585, independent: 1627, independent conditional: 0, independent unconditional: 1627, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 1760, unknown conditional: 0, unknown unconditional: 1760] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-1, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=0, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=1, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=2, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: 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: 857]: 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: 863]: 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, 170 locations, 7 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: 47.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1359 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1167 mSDsluCounter, 608 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 464 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3416 IncrementalHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 144 mSDtfsCounter, 3416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2534occurred in iteration=15, InterpolantAutomatonStates: 115, 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.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 6224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-30 16:52:02,721 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE