/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:56:44,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:56:44,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:56:44,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:56:44,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:56:44,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:56:44,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:56:44,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:56:44,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:56:44,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:56:44,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:56:44,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:56:44,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:56:44,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:56:44,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:56:44,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:56:44,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:56:45,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:56:45,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:56:45,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:56:45,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:56:45,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:56:45,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:56:45,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:56:45,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:56:45,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:56:45,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:56:45,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:56:45,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:56:45,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:56:45,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:56:45,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:56:45,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:56:45,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:56:45,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:56:45,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:56:45,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:56:45,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:56:45,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:56:45,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:56:45,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:56:45,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:56:45,061 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:56:45,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:56:45,062 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:56:45,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:56:45,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:56:45,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:56:45,062 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:56:45,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:56:45,063 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:56:45,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:56:45,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:56:45,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:56:45,065 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:56:45,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:56:45,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:56:45,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:56:45,274 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:56:45,276 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:56:45,277 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-01-28 06:56:46,435 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:56:46,649 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:56:46,650 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-01-28 06:56:46,670 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70829660c/a081db66f0844d2e853eb162e09d3632/FLAGab9682d06 [2023-01-28 06:56:46,681 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70829660c/a081db66f0844d2e853eb162e09d3632 [2023-01-28 06:56:46,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:56:46,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:56:46,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:56:46,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:56:46,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:56:46,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:56:46" (1/1) ... [2023-01-28 06:56:46,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@720bd539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:46, skipping insertion in model container [2023-01-28 06:56:46,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:56:46" (1/1) ... [2023-01-28 06:56:46,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:56:46,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:56:46,854 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-01-28 06:56:47,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:56:47,089 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:56:47,099 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-01-28 06:56:47,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:56:47,212 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:56:47,213 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:56:47,219 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:56:47,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47 WrapperNode [2023-01-28 06:56:47,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:56:47,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:56:47,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:56:47,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:56:47,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,296 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-01-28 06:56:47,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:56:47,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:56:47,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:56:47,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:56:47,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,335 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:56:47,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:56:47,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:56:47,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:56:47,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (1/1) ... [2023-01-28 06:56:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:56:47,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:56:47,374 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-01-28 06:56:47,381 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-01-28 06:56:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:56:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:56:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:56:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:56:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:56:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:56:47,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:56:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:56:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:56:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:56:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:56:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:56:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:56:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:56:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:56:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:56:47,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:56:47,416 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:56:47,609 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:56:47,610 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:56:47,918 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:56:48,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:56:48,037 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:56:48,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:56:48 BoogieIcfgContainer [2023-01-28 06:56:48,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:56:48,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:56:48,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:56:48,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:56:48,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:56:46" (1/3) ... [2023-01-28 06:56:48,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7302568e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:56:48, skipping insertion in model container [2023-01-28 06:56:48,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:56:47" (2/3) ... [2023-01-28 06:56:48,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7302568e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:56:48, skipping insertion in model container [2023-01-28 06:56:48,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:56:48" (3/3) ... [2023-01-28 06:56:48,046 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-01-28 06:56:48,060 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:56:48,061 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:56:48,061 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:56:48,108 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:56:48,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 06:56:48,208 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 06:56:48,208 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:48,214 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-01-28 06:56:48,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-01-28 06:56:48,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-01-28 06:56:48,225 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:56:48,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 06:56:48,235 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-01-28 06:56:48,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-01-28 06:56:48,276 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-01-28 06:56:48,277 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:48,277 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-01-28 06:56:48,279 INFO L119 LiptonReduction]: Number of co-enabled transitions 3256 [2023-01-28 06:56:52,861 INFO L134 LiptonReduction]: Checked pairs total: 9032 [2023-01-28 06:56:52,861 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-01-28 06:56:52,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:56:52,880 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6724f15c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:56:52,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 06:56:52,883 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-01-28 06:56:52,883 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:56:52,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:52,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:56:52,884 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-01-28 06:56:52,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 532873566, now seen corresponding path program 1 times [2023-01-28 06:56:52,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:52,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499862164] [2023-01-28 06:56:52,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:52,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499862164] [2023-01-28 06:56:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499862164] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:53,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:56:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640437386] [2023-01-28 06:56:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:53,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:56:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:56:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:56:53,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-01-28 06:56:53,284 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-01-28 06:56:53,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:53,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-01-28 06:56:53,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:54,352 INFO L130 PetriNetUnfolder]: 4903/6853 cut-off events. [2023-01-28 06:56:54,352 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-01-28 06:56:54,362 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-01-28 06:56:54,385 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-01-28 06:56:54,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 198 flow [2023-01-28 06:56:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:56:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:56:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-01-28 06:56:54,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377229080932785 [2023-01-28 06:56:54,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-01-28 06:56:54,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-01-28 06:56:54,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:54,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-01-28 06:56:54,410 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-01-28 06:56:54,413 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-01-28 06:56:54,414 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-01-28 06:56:54,415 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 392 transitions. [2023-01-28 06:56:54,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 198 flow [2023-01-28 06:56:54,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:56:54,421 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-01-28 06:56:54,422 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-01-28 06:56:54,425 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-01-28 06:56:54,425 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-01-28 06:56:54,426 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-01-28 06:56:54,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:54,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:56:54,426 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-01-28 06:56:54,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -376863777, now seen corresponding path program 1 times [2023-01-28 06:56:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627532614] [2023-01-28 06:56:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:54,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627532614] [2023-01-28 06:56:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627532614] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:55,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232153401] [2023-01-28 06:56:55,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:55,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:55,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 243 [2023-01-28 06:56:55,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:55,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:55,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 243 [2023-01-28 06:56:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:56,585 INFO L130 PetriNetUnfolder]: 11242/15116 cut-off events. [2023-01-28 06:56:56,585 INFO L131 PetriNetUnfolder]: For 760/760 co-relation queries the response was YES. [2023-01-28 06:56:56,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31355 conditions, 15116 events. 11242/15116 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 70953 event pairs, 1639 based on Foata normal form. 200/15316 useless extension candidates. Maximal degree in co-relation 31345. Up to 12817 conditions per place. [2023-01-28 06:56:56,659 INFO L137 encePairwiseOnDemand]: 230/243 looper letters, 47 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2023-01-28 06:56:56,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 264 flow [2023-01-28 06:56:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 463 transitions. [2023-01-28 06:56:56,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763374485596708 [2023-01-28 06:56:56,661 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 463 transitions. [2023-01-28 06:56:56,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 463 transitions. [2023-01-28 06:56:56,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:56,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 463 transitions. [2023-01-28 06:56:56,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:56,665 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-01-28 06:56:56,666 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-01-28 06:56:56,666 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 4 states and 463 transitions. [2023-01-28 06:56:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 264 flow [2023-01-28 06:56:56,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:56:56,669 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 155 flow [2023-01-28 06:56:56,669 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-01-28 06:56:56,670 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-01-28 06:56:56,670 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 155 flow [2023-01-28 06:56:56,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:56,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:56,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:56,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:56:56,671 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-01-28 06:56:56,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1202122654, now seen corresponding path program 1 times [2023-01-28 06:56:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876577516] [2023-01-28 06:56:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:57,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:57,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876577516] [2023-01-28 06:56:57,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876577516] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:57,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:57,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:57,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743574023] [2023-01-28 06:56:57,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:57,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:57,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:57,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 243 [2023-01-28 06:56:57,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:57,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:57,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 243 [2023-01-28 06:56:57,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:56:58,675 INFO L130 PetriNetUnfolder]: 10507/14156 cut-off events. [2023-01-28 06:56:58,675 INFO L131 PetriNetUnfolder]: For 3542/3542 co-relation queries the response was YES. [2023-01-28 06:56:58,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39214 conditions, 14156 events. 10507/14156 cut-off events. For 3542/3542 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 65796 event pairs, 2969 based on Foata normal form. 200/14356 useless extension candidates. Maximal degree in co-relation 39202. Up to 8871 conditions per place. [2023-01-28 06:56:58,747 INFO L137 encePairwiseOnDemand]: 231/243 looper letters, 54 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2023-01-28 06:56:58,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 372 flow [2023-01-28 06:56:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:56:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:56:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2023-01-28 06:56:58,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47016460905349794 [2023-01-28 06:56:58,749 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2023-01-28 06:56:58,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2023-01-28 06:56:58,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:56:58,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2023-01-28 06:56:58,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:58,752 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-01-28 06:56:58,753 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-01-28 06:56:58,753 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 155 flow. Second operand 4 states and 457 transitions. [2023-01-28 06:56:58,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 372 flow [2023-01-28 06:56:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 372 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:56:58,761 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 254 flow [2023-01-28 06:56:58,761 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-01-28 06:56:58,762 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-01-28 06:56:58,765 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 254 flow [2023-01-28 06:56:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:58,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:56:58,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:56:58,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:56:58,766 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-01-28 06:56:58,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:56:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1454752141, now seen corresponding path program 1 times [2023-01-28 06:56:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:56:58,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565425303] [2023-01-28 06:56:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:56:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:56:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:56:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:56:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:56:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565425303] [2023-01-28 06:56:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565425303] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:56:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:56:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:56:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56692688] [2023-01-28 06:56:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:56:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:56:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:56:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:56:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:56:59,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-01-28 06:56:59,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:56:59,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:56:59,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-01-28 06:56:59,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:00,647 INFO L130 PetriNetUnfolder]: 8408/11833 cut-off events. [2023-01-28 06:57:00,648 INFO L131 PetriNetUnfolder]: For 9619/9695 co-relation queries the response was YES. [2023-01-28 06:57:00,668 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-01-28 06:57:00,719 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 62 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-01-28 06:57:00,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 522 flow [2023-01-28 06:57:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:57:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:57:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-01-28 06:57:00,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171467764060357 [2023-01-28 06:57:00,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-01-28 06:57:00,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-01-28 06:57:00,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:00,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-01-28 06:57:00,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:00,724 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-01-28 06:57:00,725 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-01-28 06:57:00,725 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 254 flow. Second operand 3 states and 377 transitions. [2023-01-28 06:57:00,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 522 flow [2023-01-28 06:57:00,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 511 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:57:00,751 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 293 flow [2023-01-28 06:57:00,751 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-01-28 06:57:00,752 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-01-28 06:57:00,752 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 293 flow [2023-01-28 06:57:00,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:00,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:00,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:00,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:57:00,753 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-01-28 06:57:00,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2145966666, now seen corresponding path program 1 times [2023-01-28 06:57:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:00,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6873756] [2023-01-28 06:57:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6873756] [2023-01-28 06:57:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6873756] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:57:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87579233] [2023-01-28 06:57:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:01,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:57:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:57:01,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:57:01,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-01-28 06:57:01,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:01,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:01,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-01-28 06:57:01,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:02,618 INFO L130 PetriNetUnfolder]: 8936/12565 cut-off events. [2023-01-28 06:57:02,618 INFO L131 PetriNetUnfolder]: For 10105/10290 co-relation queries the response was YES. [2023-01-28 06:57:02,639 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-01-28 06:57:02,689 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 79 selfloop transitions, 14 changer transitions 0/101 dead transitions. [2023-01-28 06:57:02,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 715 flow [2023-01-28 06:57:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:57:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:57:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-01-28 06:57:02,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-01-28 06:57:02,692 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-01-28 06:57:02,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-01-28 06:57:02,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:02,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-01-28 06:57:02,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:02,695 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-01-28 06:57:02,696 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-01-28 06:57:02,696 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 293 flow. Second operand 4 states and 504 transitions. [2023-01-28 06:57:02,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 715 flow [2023-01-28 06:57:02,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:57:02,724 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 405 flow [2023-01-28 06:57:02,725 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-01-28 06:57:02,725 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-01-28 06:57:02,725 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 405 flow [2023-01-28 06:57:02,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:02,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:02,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:02,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:57:02,726 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-01-28 06:57:02,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1561558364, now seen corresponding path program 1 times [2023-01-28 06:57:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448494977] [2023-01-28 06:57:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:02,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448494977] [2023-01-28 06:57:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448494977] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:02,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:02,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:57:02,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685395112] [2023-01-28 06:57:02,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:02,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:57:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:57:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:57:02,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-01-28 06:57:02,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:02,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:02,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-01-28 06:57:02,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:04,079 INFO L130 PetriNetUnfolder]: 9046/12754 cut-off events. [2023-01-28 06:57:04,079 INFO L131 PetriNetUnfolder]: For 16897/17109 co-relation queries the response was YES. [2023-01-28 06:57:04,102 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-01-28 06:57:04,159 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 86 selfloop transitions, 22 changer transitions 0/116 dead transitions. [2023-01-28 06:57:04,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 116 transitions, 929 flow [2023-01-28 06:57:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:57:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:57:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2023-01-28 06:57:04,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2023-01-28 06:57:04,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2023-01-28 06:57:04,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2023-01-28 06:57:04,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:04,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2023-01-28 06:57:04,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:04,165 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-01-28 06:57:04,166 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-01-28 06:57:04,166 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 405 flow. Second operand 4 states and 513 transitions. [2023-01-28 06:57:04,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 116 transitions, 929 flow [2023-01-28 06:57:04,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 911 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:57:04,202 INFO L231 Difference]: Finished difference. Result has 54 places, 74 transitions, 579 flow [2023-01-28 06:57:04,202 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-01-28 06:57:04,203 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-01-28 06:57:04,203 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 74 transitions, 579 flow [2023-01-28 06:57:04,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:04,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:04,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:04,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:57:04,204 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-01-28 06:57:04,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1564058204, now seen corresponding path program 2 times [2023-01-28 06:57:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479772414] [2023-01-28 06:57:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:04,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479772414] [2023-01-28 06:57:04,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479772414] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:04,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:57:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745207775] [2023-01-28 06:57:04,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:04,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:57:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:04,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:57:04,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:57:04,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-01-28 06:57:04,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 74 transitions, 579 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:04,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:04,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-01-28 06:57:04,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:05,864 INFO L130 PetriNetUnfolder]: 9123/12835 cut-off events. [2023-01-28 06:57:05,865 INFO L131 PetriNetUnfolder]: For 26338/26790 co-relation queries the response was YES. [2023-01-28 06:57:05,882 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-01-28 06:57:05,930 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 88 selfloop transitions, 30 changer transitions 0/126 dead transitions. [2023-01-28 06:57:05,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 1140 flow [2023-01-28 06:57:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:57:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:57:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-01-28 06:57:05,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236625514403292 [2023-01-28 06:57:05,933 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-01-28 06:57:05,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-01-28 06:57:05,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:05,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-01-28 06:57:05,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:05,936 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-01-28 06:57:05,936 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-01-28 06:57:05,937 INFO L175 Difference]: Start difference. First operand has 54 places, 74 transitions, 579 flow. Second operand 4 states and 509 transitions. [2023-01-28 06:57:05,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 1140 flow [2023-01-28 06:57:05,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 1111 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 06:57:05,972 INFO L231 Difference]: Finished difference. Result has 57 places, 85 transitions, 762 flow [2023-01-28 06:57:05,972 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-01-28 06:57:05,973 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-01-28 06:57:05,973 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 85 transitions, 762 flow [2023-01-28 06:57:05,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:05,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:05,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:05,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:57:05,974 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-01-28 06:57:05,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1199061782, now seen corresponding path program 1 times [2023-01-28 06:57:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952600047] [2023-01-28 06:57:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952600047] [2023-01-28 06:57:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952600047] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:57:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551491870] [2023-01-28 06:57:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:06,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:57:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:57:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:57:06,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 243 [2023-01-28 06:57:06,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 85 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:06,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:06,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 243 [2023-01-28 06:57:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:07,861 INFO L130 PetriNetUnfolder]: 9560/13354 cut-off events. [2023-01-28 06:57:07,861 INFO L131 PetriNetUnfolder]: For 39916/40607 co-relation queries the response was YES. [2023-01-28 06:57:07,886 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-01-28 06:57:07,940 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 98 selfloop transitions, 40 changer transitions 0/146 dead transitions. [2023-01-28 06:57:07,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 146 transitions, 1409 flow [2023-01-28 06:57:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:57:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:57:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-01-28 06:57:07,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152263374485597 [2023-01-28 06:57:07,944 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-01-28 06:57:07,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-01-28 06:57:07,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:07,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-01-28 06:57:07,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:07,949 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-01-28 06:57:07,950 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-01-28 06:57:07,950 INFO L175 Difference]: Start difference. First operand has 57 places, 85 transitions, 762 flow. Second operand 5 states and 626 transitions. [2023-01-28 06:57:07,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 146 transitions, 1409 flow [2023-01-28 06:57:07,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 146 transitions, 1376 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-01-28 06:57:08,001 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 963 flow [2023-01-28 06:57:08,002 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-01-28 06:57:08,005 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-01-28 06:57:08,005 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 963 flow [2023-01-28 06:57:08,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:08,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:08,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:08,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:57:08,006 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-01-28 06:57:08,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1163671237, now seen corresponding path program 1 times [2023-01-28 06:57:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369167890] [2023-01-28 06:57:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:08,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369167890] [2023-01-28 06:57:08,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369167890] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:08,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:08,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:57:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255913798] [2023-01-28 06:57:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:57:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:57:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:57:08,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-01-28 06:57:08,484 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-01-28 06:57:08,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:08,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-01-28 06:57:08,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:10,223 INFO L130 PetriNetUnfolder]: 10241/14238 cut-off events. [2023-01-28 06:57:10,223 INFO L131 PetriNetUnfolder]: For 57737/58758 co-relation queries the response was YES. [2023-01-28 06:57:10,265 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-01-28 06:57:10,334 INFO L137 encePairwiseOnDemand]: 234/243 looper letters, 112 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2023-01-28 06:57:10,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 161 transitions, 1684 flow [2023-01-28 06:57:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:57:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:57:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-01-28 06:57:10,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234567901234568 [2023-01-28 06:57:10,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-01-28 06:57:10,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-01-28 06:57:10,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:10,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-01-28 06:57:10,340 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-01-28 06:57:10,342 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-01-28 06:57:10,342 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-01-28 06:57:10,342 INFO L175 Difference]: Start difference. First operand has 61 places, 95 transitions, 963 flow. Second operand 5 states and 636 transitions. [2023-01-28 06:57:10,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 161 transitions, 1684 flow [2023-01-28 06:57:10,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 161 transitions, 1594 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-01-28 06:57:10,411 INFO L231 Difference]: Finished difference. Result has 63 places, 106 transitions, 1124 flow [2023-01-28 06:57:10,411 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-01-28 06:57:10,411 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-01-28 06:57:10,412 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 106 transitions, 1124 flow [2023-01-28 06:57:10,412 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-01-28 06:57:10,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:10,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:10,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:57:10,413 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-01-28 06:57:10,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1241166277, now seen corresponding path program 2 times [2023-01-28 06:57:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191975204] [2023-01-28 06:57:10,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191975204] [2023-01-28 06:57:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191975204] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:10,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:10,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:57:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415532915] [2023-01-28 06:57:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:10,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:57:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:57:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:57:10,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 243 [2023-01-28 06:57:10,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 106 transitions, 1124 flow. Second operand has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:10,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:10,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 243 [2023-01-28 06:57:10,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:12,389 INFO L130 PetriNetUnfolder]: 11755/16361 cut-off events. [2023-01-28 06:57:12,390 INFO L131 PetriNetUnfolder]: For 82054/83124 co-relation queries the response was YES. [2023-01-28 06:57:12,425 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-01-28 06:57:12,483 INFO L137 encePairwiseOnDemand]: 234/243 looper letters, 142 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2023-01-28 06:57:12,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 194 transitions, 2224 flow [2023-01-28 06:57:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:57:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:57:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-01-28 06:57:12,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152263374485597 [2023-01-28 06:57:12,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-01-28 06:57:12,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-01-28 06:57:12,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:12,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-01-28 06:57:12,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:12,489 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-01-28 06:57:12,489 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-01-28 06:57:12,489 INFO L175 Difference]: Start difference. First operand has 63 places, 106 transitions, 1124 flow. Second operand 5 states and 626 transitions. [2023-01-28 06:57:12,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 194 transitions, 2224 flow [2023-01-28 06:57:12,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 194 transitions, 2061 flow, removed 42 selfloop flow, removed 3 redundant places. [2023-01-28 06:57:12,682 INFO L231 Difference]: Finished difference. Result has 66 places, 131 transitions, 1495 flow [2023-01-28 06:57:12,682 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-01-28 06:57:12,682 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-01-28 06:57:12,682 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 131 transitions, 1495 flow [2023-01-28 06:57:12,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:12,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:12,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:12,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:57:12,683 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-01-28 06:57:12,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1792374716, now seen corresponding path program 1 times [2023-01-28 06:57:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:12,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759487606] [2023-01-28 06:57:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:13,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:13,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759487606] [2023-01-28 06:57:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759487606] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:13,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:57:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588876638] [2023-01-28 06:57:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:57:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:13,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:57:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:57:13,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-01-28 06:57:13,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 131 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:13,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:13,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-01-28 06:57:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:14,860 INFO L130 PetriNetUnfolder]: 13089/18191 cut-off events. [2023-01-28 06:57:14,861 INFO L131 PetriNetUnfolder]: For 122595/124106 co-relation queries the response was YES. [2023-01-28 06:57:14,903 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-01-28 06:57:14,968 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 136 selfloop transitions, 65 changer transitions 0/209 dead transitions. [2023-01-28 06:57:14,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 2519 flow [2023-01-28 06:57:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:57:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:57:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-01-28 06:57:14,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089163237311386 [2023-01-28 06:57:14,980 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-01-28 06:57:14,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-01-28 06:57:14,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:14,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-01-28 06:57:14,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:14,985 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-01-28 06:57:14,985 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-01-28 06:57:14,986 INFO L175 Difference]: Start difference. First operand has 66 places, 131 transitions, 1495 flow. Second operand 6 states and 742 transitions. [2023-01-28 06:57:14,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 2519 flow [2023-01-28 06:57:15,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 209 transitions, 2390 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-01-28 06:57:15,251 INFO L231 Difference]: Finished difference. Result has 70 places, 142 transitions, 1752 flow [2023-01-28 06:57:15,251 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-01-28 06:57:15,252 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-01-28 06:57:15,252 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 142 transitions, 1752 flow [2023-01-28 06:57:15,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:15,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:15,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:57:15,253 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-01-28 06:57:15,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash 689555593, now seen corresponding path program 1 times [2023-01-28 06:57:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754792655] [2023-01-28 06:57:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:15,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754792655] [2023-01-28 06:57:15,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754792655] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:15,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:15,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:57:15,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825251857] [2023-01-28 06:57:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:15,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:57:15,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:57:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:57:15,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-28 06:57:15,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 142 transitions, 1752 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:15,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:15,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-28 06:57:15,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:16,219 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-01-28 06:57:16,220 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,220 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,220 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,220 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,220 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-01-28 06:57:16,220 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,221 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,221 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,221 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,221 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-01-28 06:57:16,221 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,222 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,222 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,222 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,222 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-01-28 06:57:16,222 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,222 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,223 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,223 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:16,404 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-01-28 06:57:16,405 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 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-01-28 06:57:16,405 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,406 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-01-28 06:57:16,406 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,406 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-01-28 06:57:16,406 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,407 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-01-28 06:57:16,407 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,408 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-01-28 06:57:16,408 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,408 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-01-28 06:57:16,408 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,409 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,409 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,409 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-01-28 06:57:16,409 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,409 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,409 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,409 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 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-01-28 06:57:16,410 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 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-01-28 06:57:16,410 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,410 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:16,525 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-01-28 06:57:16,525 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,525 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,525 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,525 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 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-01-28 06:57:16,526 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 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-01-28 06:57:16,526 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,568 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-01-28 06:57:16,568 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 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-01-28 06:57:16,569 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,569 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-01-28 06:57:16,569 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:17,052 INFO L130 PetriNetUnfolder]: 10720/14795 cut-off events. [2023-01-28 06:57:17,052 INFO L131 PetriNetUnfolder]: For 175017/179260 co-relation queries the response was YES. [2023-01-28 06:57:17,083 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-01-28 06:57:17,138 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 348 selfloop transitions, 10 changer transitions 4/374 dead transitions. [2023-01-28 06:57:17,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 374 transitions, 5478 flow [2023-01-28 06:57:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:57:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:57:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-01-28 06:57:17,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078189300411523 [2023-01-28 06:57:17,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-01-28 06:57:17,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-01-28 06:57:17,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:17,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-01-28 06:57:17,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:17,144 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-01-28 06:57:17,144 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-01-28 06:57:17,144 INFO L175 Difference]: Start difference. First operand has 70 places, 142 transitions, 1752 flow. Second operand 5 states and 617 transitions. [2023-01-28 06:57:17,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 374 transitions, 5478 flow [2023-01-28 06:57:17,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 374 transitions, 5160 flow, removed 133 selfloop flow, removed 3 redundant places. [2023-01-28 06:57:17,310 INFO L231 Difference]: Finished difference. Result has 74 places, 141 transitions, 1614 flow [2023-01-28 06:57:17,310 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-01-28 06:57:17,310 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-01-28 06:57:17,310 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 141 transitions, 1614 flow [2023-01-28 06:57:17,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:17,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:17,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:17,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:57:17,311 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-01-28 06:57:17,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash -312344570, now seen corresponding path program 1 times [2023-01-28 06:57:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734692773] [2023-01-28 06:57:17,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:17,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:17,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:17,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734692773] [2023-01-28 06:57:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734692773] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:57:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478382857] [2023-01-28 06:57:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:17,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:57:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:57:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:57:17,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-28 06:57:17,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 141 transitions, 1614 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:17,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:17,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-28 06:57:17,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:18,250 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-01-28 06:57:18,250 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,250 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,250 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,250 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 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-01-28 06:57:18,251 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 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-01-28 06:57:18,251 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,251 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,252 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,252 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-01-28 06:57:18,252 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,252 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,252 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,252 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:18,401 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-01-28 06:57:18,401 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,401 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 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-01-28 06:57:18,402 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 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-01-28 06:57:18,402 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,402 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,403 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-01-28 06:57:18,403 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,403 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,403 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,403 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,404 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-01-28 06:57:18,404 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,404 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,404 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,404 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 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-01-28 06:57:18,405 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 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-01-28 06:57:18,405 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,405 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,406 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-01-28 06:57:18,406 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,406 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,407 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-01-28 06:57:18,407 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,407 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,408 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-01-28 06:57:18,408 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,408 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:18,493 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-01-28 06:57:18,493 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,493 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,493 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,493 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,493 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-01-28 06:57:18,493 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,493 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,493 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,494 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,494 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-01-28 06:57:18,494 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,494 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,494 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,494 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,495 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-01-28 06:57:18,495 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,495 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,495 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,495 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 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-01-28 06:57:18,496 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 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-01-28 06:57:18,496 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,496 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:18,805 INFO L130 PetriNetUnfolder]: 8627/12033 cut-off events. [2023-01-28 06:57:18,805 INFO L131 PetriNetUnfolder]: For 126328/130244 co-relation queries the response was YES. [2023-01-28 06:57:18,827 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-01-28 06:57:18,861 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 407 selfloop transitions, 19 changer transitions 19/457 dead transitions. [2023-01-28 06:57:18,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 457 transitions, 6327 flow [2023-01-28 06:57:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:57:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:57:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-01-28 06:57:18,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5091122868900647 [2023-01-28 06:57:18,863 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-01-28 06:57:18,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-01-28 06:57:18,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:18,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-01-28 06:57:18,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:18,868 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-01-28 06:57:18,869 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-01-28 06:57:18,869 INFO L175 Difference]: Start difference. First operand has 74 places, 141 transitions, 1614 flow. Second operand 7 states and 866 transitions. [2023-01-28 06:57:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 457 transitions, 6327 flow [2023-01-28 06:57:19,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 457 transitions, 6322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:57:19,073 INFO L231 Difference]: Finished difference. Result has 82 places, 138 transitions, 1599 flow [2023-01-28 06:57:19,073 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-01-28 06:57:19,073 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-01-28 06:57:19,073 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 138 transitions, 1599 flow [2023-01-28 06:57:19,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:19,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:19,074 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-01-28 06:57:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:57:19,074 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-01-28 06:57:19,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1713990753, now seen corresponding path program 1 times [2023-01-28 06:57:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:19,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397384718] [2023-01-28 06:57:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:19,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397384718] [2023-01-28 06:57:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397384718] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:19,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:57:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567874771] [2023-01-28 06:57:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:19,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:57:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:19,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:57:19,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:57:19,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-28 06:57:19,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 138 transitions, 1599 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:19,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:19,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-28 06:57:19,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:20,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][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-01-28 06:57:20,084 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,084 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,084 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,085 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,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][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-01-28 06:57:20,085 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,085 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,085 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,085 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,086 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-01-28 06:57:20,086 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,086 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,086 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,086 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,087 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-01-28 06:57:20,087 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,087 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,087 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,087 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-01-28 06:57:20,339 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-01-28 06:57:20,339 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,339 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,339 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,339 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 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-01-28 06:57:20,340 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 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-01-28 06:57:20,340 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,340 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,341 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-01-28 06:57:20,341 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,341 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,341 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,341 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,342 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-01-28 06:57:20,342 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,342 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,342 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,342 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,342 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-01-28 06:57:20,343 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 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-01-28 06:57:20,343 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,343 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-01-28 06:57:20,343 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 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-01-28 06:57:20,344 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,344 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,345 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-01-28 06:57:20,345 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,345 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,345 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,345 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-01-28 06:57:20,427 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-01-28 06:57:20,427 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 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-01-28 06:57:20,428 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,428 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-01-28 06:57:20,428 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,429 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,429 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,429 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,429 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-01-28 06:57:20,429 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,429 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,430 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,430 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,430 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-01-28 06:57:20,430 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,430 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,430 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,430 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,431 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-01-28 06:57:20,431 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,431 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,431 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,431 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-01-28 06:57:20,712 INFO L130 PetriNetUnfolder]: 8104/11219 cut-off events. [2023-01-28 06:57:20,712 INFO L131 PetriNetUnfolder]: For 124594/128382 co-relation queries the response was YES. [2023-01-28 06:57:20,737 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-01-28 06:57:20,768 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 413 selfloop transitions, 28 changer transitions 34/487 dead transitions. [2023-01-28 06:57:20,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 487 transitions, 6767 flow [2023-01-28 06:57:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:57:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:57:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2023-01-28 06:57:20,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089163237311386 [2023-01-28 06:57:20,771 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2023-01-28 06:57:20,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2023-01-28 06:57:20,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:20,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2023-01-28 06:57:20,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:20,776 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-01-28 06:57:20,777 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-01-28 06:57:20,777 INFO L175 Difference]: Start difference. First operand has 82 places, 138 transitions, 1599 flow. Second operand 9 states and 1113 transitions. [2023-01-28 06:57:20,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 487 transitions, 6767 flow [2023-01-28 06:57:21,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 487 transitions, 6330 flow, removed 129 selfloop flow, removed 6 redundant places. [2023-01-28 06:57:21,210 INFO L231 Difference]: Finished difference. Result has 87 places, 140 transitions, 1550 flow [2023-01-28 06:57:21,210 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-01-28 06:57:21,211 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-01-28 06:57:21,211 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 140 transitions, 1550 flow [2023-01-28 06:57:21,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:21,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:21,211 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-01-28 06:57:21,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:57:21,212 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-01-28 06:57:21,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1562489526, now seen corresponding path program 1 times [2023-01-28 06:57:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699125865] [2023-01-28 06:57:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699125865] [2023-01-28 06:57:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699125865] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:21,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:57:21,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127442240] [2023-01-28 06:57:21,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:21,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:57:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:57:21,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:57:21,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 243 [2023-01-28 06:57:21,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 140 transitions, 1550 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:21,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:21,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 243 [2023-01-28 06:57:21,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:24,460 INFO L130 PetriNetUnfolder]: 14705/20962 cut-off events. [2023-01-28 06:57:24,460 INFO L131 PetriNetUnfolder]: For 115665/115665 co-relation queries the response was YES. [2023-01-28 06:57:24,517 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-01-28 06:57:24,551 INFO L137 encePairwiseOnDemand]: 228/243 looper letters, 189 selfloop transitions, 131 changer transitions 259/579 dead transitions. [2023-01-28 06:57:24,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 579 transitions, 6890 flow [2023-01-28 06:57:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 06:57:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 06:57:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1570 transitions. [2023-01-28 06:57:24,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46149323927101704 [2023-01-28 06:57:24,555 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1570 transitions. [2023-01-28 06:57:24,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1570 transitions. [2023-01-28 06:57:24,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:24,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1570 transitions. [2023-01-28 06:57:24,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 112.14285714285714) internal successors, (1570), 14 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:24,562 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-01-28 06:57:24,563 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-01-28 06:57:24,563 INFO L175 Difference]: Start difference. First operand has 87 places, 140 transitions, 1550 flow. Second operand 14 states and 1570 transitions. [2023-01-28 06:57:24,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 579 transitions, 6890 flow [2023-01-28 06:57:25,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 579 transitions, 6165 flow, removed 232 selfloop flow, removed 4 redundant places. [2023-01-28 06:57:25,900 INFO L231 Difference]: Finished difference. Result has 105 places, 193 transitions, 2534 flow [2023-01-28 06:57:25,900 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-01-28 06:57:25,900 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2023-01-28 06:57:25,900 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 193 transitions, 2534 flow [2023-01-28 06:57:25,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:25,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:25,901 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-01-28 06:57:25,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 06:57:25,901 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-01-28 06:57:25,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1468939936, now seen corresponding path program 2 times [2023-01-28 06:57:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508564222] [2023-01-28 06:57:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:26,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508564222] [2023-01-28 06:57:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508564222] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:26,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:26,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:57:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401975375] [2023-01-28 06:57:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:26,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:57:26,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:57:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:57:26,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 243 [2023-01-28 06:57:26,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 193 transitions, 2534 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:26,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:26,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 243 [2023-01-28 06:57:26,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:27,064 INFO L130 PetriNetUnfolder]: 3995/5818 cut-off events. [2023-01-28 06:57:27,064 INFO L131 PetriNetUnfolder]: For 49265/50213 co-relation queries the response was YES. [2023-01-28 06:57:27,083 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-01-28 06:57:27,095 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 253 selfloop transitions, 18 changer transitions 85/378 dead transitions. [2023-01-28 06:57:27,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 378 transitions, 5596 flow [2023-01-28 06:57:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:57:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:57:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 963 transitions. [2023-01-28 06:57:27,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2023-01-28 06:57:27,098 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 963 transitions. [2023-01-28 06:57:27,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 963 transitions. [2023-01-28 06:57:27,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:27,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 963 transitions. [2023-01-28 06:57:27,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.375) internal successors, (963), 8 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:27,102 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-01-28 06:57:27,103 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-01-28 06:57:27,103 INFO L175 Difference]: Start difference. First operand has 105 places, 193 transitions, 2534 flow. Second operand 8 states and 963 transitions. [2023-01-28 06:57:27,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 378 transitions, 5596 flow [2023-01-28 06:57:27,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 378 transitions, 5234 flow, removed 155 selfloop flow, removed 8 redundant places. [2023-01-28 06:57:27,228 INFO L231 Difference]: Finished difference. Result has 99 places, 151 transitions, 1817 flow [2023-01-28 06:57:27,228 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-01-28 06:57:27,228 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2023-01-28 06:57:27,228 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 151 transitions, 1817 flow [2023-01-28 06:57:27,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:27,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:27,229 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-01-28 06:57:27,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 06:57:27,229 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-01-28 06:57:27,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1043029499, now seen corresponding path program 1 times [2023-01-28 06:57:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773263036] [2023-01-28 06:57:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773263036] [2023-01-28 06:57:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773263036] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:57:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695360031] [2023-01-28 06:57:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:27,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:57:27,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:27,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:57:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:57:27,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 243 [2023-01-28 06:57:27,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 151 transitions, 1817 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:27,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:27,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 243 [2023-01-28 06:57:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:28,594 INFO L130 PetriNetUnfolder]: 4881/7404 cut-off events. [2023-01-28 06:57:28,595 INFO L131 PetriNetUnfolder]: For 38105/38105 co-relation queries the response was YES. [2023-01-28 06:57:28,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40715 conditions, 7404 events. 4881/7404 cut-off events. For 38105/38105 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 41459 event pairs, 619 based on Foata normal form. 1/7405 useless extension candidates. Maximal degree in co-relation 40682. Up to 3400 conditions per place. [2023-01-28 06:57:28,640 INFO L137 encePairwiseOnDemand]: 230/243 looper letters, 114 selfloop transitions, 39 changer transitions 157/310 dead transitions. [2023-01-28 06:57:28,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 310 transitions, 4074 flow [2023-01-28 06:57:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:57:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:57:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2023-01-28 06:57:28,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4670781893004115 [2023-01-28 06:57:28,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2023-01-28 06:57:28,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2023-01-28 06:57:28,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:28,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2023-01-28 06:57:28,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:28,646 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-01-28 06:57:28,647 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-01-28 06:57:28,647 INFO L175 Difference]: Start difference. First operand has 99 places, 151 transitions, 1817 flow. Second operand 6 states and 681 transitions. [2023-01-28 06:57:28,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 310 transitions, 4074 flow [2023-01-28 06:57:28,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 310 transitions, 3866 flow, removed 45 selfloop flow, removed 9 redundant places. [2023-01-28 06:57:28,829 INFO L231 Difference]: Finished difference. Result has 97 places, 105 transitions, 1271 flow [2023-01-28 06:57:28,830 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=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1271, PETRI_PLACES=97, PETRI_TRANSITIONS=105} [2023-01-28 06:57:28,830 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2023-01-28 06:57:28,830 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 105 transitions, 1271 flow [2023-01-28 06:57:28,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:28,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:28,831 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-01-28 06:57:28,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 06:57:28,836 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-01-28 06:57:28,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:28,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1899330447, now seen corresponding path program 2 times [2023-01-28 06:57:28,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:28,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347109109] [2023-01-28 06:57:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347109109] [2023-01-28 06:57:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347109109] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:57:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930582238] [2023-01-28 06:57:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:29,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:57:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:57:29,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:57:29,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 243 [2023-01-28 06:57:29,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 105 transitions, 1271 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-01-28 06:57:29,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:29,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 243 [2023-01-28 06:57:29,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:29,696 INFO L130 PetriNetUnfolder]: 2753/4346 cut-off events. [2023-01-28 06:57:29,696 INFO L131 PetriNetUnfolder]: For 20893/20893 co-relation queries the response was YES. [2023-01-28 06:57:29,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23476 conditions, 4346 events. 2753/4346 cut-off events. For 20893/20893 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23704 event pairs, 793 based on Foata normal form. 1/4347 useless extension candidates. Maximal degree in co-relation 23444. Up to 2443 conditions per place. [2023-01-28 06:57:29,711 INFO L137 encePairwiseOnDemand]: 238/243 looper letters, 59 selfloop transitions, 5 changer transitions 81/145 dead transitions. [2023-01-28 06:57:29,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 145 transitions, 1833 flow [2023-01-28 06:57:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:57:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:57:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-01-28 06:57:29,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46502057613168724 [2023-01-28 06:57:29,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-01-28 06:57:29,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-01-28 06:57:29,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:29,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-01-28 06:57:29,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:29,715 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-01-28 06:57:29,716 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-01-28 06:57:29,716 INFO L175 Difference]: Start difference. First operand has 97 places, 105 transitions, 1271 flow. Second operand 4 states and 452 transitions. [2023-01-28 06:57:29,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 145 transitions, 1833 flow [2023-01-28 06:57:29,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 145 transitions, 1600 flow, removed 22 selfloop flow, removed 12 redundant places. [2023-01-28 06:57:29,808 INFO L231 Difference]: Finished difference. Result has 85 places, 52 transitions, 362 flow [2023-01-28 06:57:29,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=85, PETRI_TRANSITIONS=52} [2023-01-28 06:57:29,809 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-01-28 06:57:29,809 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 52 transitions, 362 flow [2023-01-28 06:57:29,809 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-01-28 06:57:29,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:29,809 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-01-28 06:57:29,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-28 06:57:29,809 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-01-28 06:57:29,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -243540721, now seen corresponding path program 3 times [2023-01-28 06:57:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:29,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547495733] [2023-01-28 06:57:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:29,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547495733] [2023-01-28 06:57:32,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547495733] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 06:57:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042274007] [2023-01-28 06:57:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:32,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 06:57:32,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:32,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 06:57:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-01-28 06:57:32,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 243 [2023-01-28 06:57:32,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 52 transitions, 362 flow. Second operand has 10 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:32,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:32,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 243 [2023-01-28 06:57:32,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:33,091 INFO L130 PetriNetUnfolder]: 1484/2415 cut-off events. [2023-01-28 06:57:33,091 INFO L131 PetriNetUnfolder]: For 7950/7950 co-relation queries the response was YES. [2023-01-28 06:57:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11023 conditions, 2415 events. 1484/2415 cut-off events. For 7950/7950 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11980 event pairs, 150 based on Foata normal form. 1/2416 useless extension candidates. Maximal degree in co-relation 10999. Up to 1009 conditions per place. [2023-01-28 06:57:33,102 INFO L137 encePairwiseOnDemand]: 233/243 looper letters, 94 selfloop transitions, 20 changer transitions 26/140 dead transitions. [2023-01-28 06:57:33,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 140 transitions, 1203 flow [2023-01-28 06:57:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:57:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:57:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 840 transitions. [2023-01-28 06:57:33,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43209876543209874 [2023-01-28 06:57:33,105 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 840 transitions. [2023-01-28 06:57:33,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 840 transitions. [2023-01-28 06:57:33,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:33,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 840 transitions. [2023-01-28 06:57:33,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:33,109 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-01-28 06:57:33,109 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-01-28 06:57:33,110 INFO L175 Difference]: Start difference. First operand has 85 places, 52 transitions, 362 flow. Second operand 8 states and 840 transitions. [2023-01-28 06:57:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 140 transitions, 1203 flow [2023-01-28 06:57:33,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 1058 flow, removed 44 selfloop flow, removed 15 redundant places. [2023-01-28 06:57:33,153 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 410 flow [2023-01-28 06:57:33,153 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-01-28 06:57:33,154 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-01-28 06:57:33,154 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 410 flow [2023-01-28 06:57:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:33,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:33,155 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-01-28 06:57:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-01-28 06:57:33,155 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-01-28 06:57:33,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -488113921, now seen corresponding path program 4 times [2023-01-28 06:57:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:33,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891467933] [2023-01-28 06:57:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:57:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:57:34,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:57:34,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891467933] [2023-01-28 06:57:34,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891467933] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:57:34,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:57:34,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-01-28 06:57:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281699289] [2023-01-28 06:57:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:57:34,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-28 06:57:34,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:57:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-28 06:57:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-01-28 06:57:34,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-01-28 06:57:34,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 410 flow. Second operand has 10 states, 10 states have (on average 109.5) internal successors, (1095), 10 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:34,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:57:34,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-01-28 06:57:34,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:57:35,101 INFO L130 PetriNetUnfolder]: 1506/2471 cut-off events. [2023-01-28 06:57:35,101 INFO L131 PetriNetUnfolder]: For 7110/7115 co-relation queries the response was YES. [2023-01-28 06:57:35,105 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 12324 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-01-28 06:57:35,108 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 82 selfloop transitions, 8 changer transitions 64/157 dead transitions. [2023-01-28 06:57:35,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 157 transitions, 1305 flow [2023-01-28 06:57:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:57:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:57:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-01-28 06:57:35,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48736037624926515 [2023-01-28 06:57:35,110 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-01-28 06:57:35,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-01-28 06:57:35,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:57:35,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-01-28 06:57:35,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:35,114 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-01-28 06:57:35,114 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-01-28 06:57:35,114 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 410 flow. Second operand 7 states and 829 transitions. [2023-01-28 06:57:35,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 157 transitions, 1305 flow [2023-01-28 06:57:35,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 1300 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 06:57:35,148 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 448 flow [2023-01-28 06:57:35,148 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-01-28 06:57:35,148 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-01-28 06:57:35,148 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 448 flow [2023-01-28 06:57:35,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 109.5) internal successors, (1095), 10 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:57:35,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:57:35,149 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-01-28 06:57:35,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-01-28 06:57:35,149 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-01-28 06:57:35,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:57:35,149 INFO L85 PathProgramCache]: Analyzing trace with hash -909790857, now seen corresponding path program 5 times [2023-01-28 06:57:35,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:57:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695229189] [2023-01-28 06:57:35,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:57:35,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:57:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:57:35,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:57:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:57:35,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:57:35,297 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:57:35,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 06:57:35,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 06:57:35,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 06:57:35,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 06:57:35,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 06:57:35,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 06:57:35,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 06:57:35,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 06:57:35,302 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:57:35,307 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:57:35,307 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:57:35,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:57:35 BasicIcfg [2023-01-28 06:57:35,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:57:35,371 INFO L158 Benchmark]: Toolchain (without parser) took 48687.09ms. Allocated memory was 358.6MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 321.4MB in the beginning and 1.1GB in the end (delta: -780.3MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-01-28 06:57:35,372 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:57:35,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.51ms. Allocated memory is still 358.6MB. Free memory was 321.4MB in the beginning and 297.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:57:35,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.80ms. Allocated memory is still 358.6MB. Free memory was 297.3MB in the beginning and 294.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:57:35,372 INFO L158 Benchmark]: Boogie Preprocessor took 48.14ms. Allocated memory is still 358.6MB. Free memory was 294.5MB in the beginning and 292.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:57:35,372 INFO L158 Benchmark]: RCFGBuilder took 694.08ms. Allocated memory is still 358.6MB. Free memory was 292.4MB in the beginning and 313.9MB in the end (delta: -21.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.0GB. [2023-01-28 06:57:35,373 INFO L158 Benchmark]: TraceAbstraction took 47329.75ms. Allocated memory was 358.6MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 312.7MB in the beginning and 1.1GB in the end (delta: -789.0MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. [2023-01-28 06:57:35,374 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 534.51ms. Allocated memory is still 358.6MB. Free memory was 321.4MB in the beginning and 297.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.80ms. Allocated memory is still 358.6MB. Free memory was 297.3MB in the beginning and 294.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.14ms. Allocated memory is still 358.6MB. Free memory was 294.5MB in the beginning and 292.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 694.08ms. Allocated memory is still 358.6MB. Free memory was 292.4MB in the beginning and 313.9MB in the end (delta: -21.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.0GB. * TraceAbstraction took 47329.75ms. Allocated memory was 358.6MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 312.7MB in the beginning and 1.1GB in the end (delta: -789.0MB). Peak memory consumption was 2.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 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.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 950 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 950 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2899 IncrementalHoareTripleChecker+Invalid, 3087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 57 mSDtfsCounter, 2899 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.1s 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.6s 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-01-28 06:57:35,397 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...