./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:14:17,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:14:17,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:14:17,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:14:17,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:14:17,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:14:17,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:14:17,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:14:17,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:14:17,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:14:17,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:14:17,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:14:17,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:14:17,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:14:17,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:14:17,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:14:17,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:14:17,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:14:17,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:14:17,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:14:17,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:14:17,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:14:17,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:14:17,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:14:17,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:14:17,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:14:17,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:14:17,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:14:17,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:14:17,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:14:17,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:14:17,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:14:17,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:14:17,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:14:17,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:14:17,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:14:17,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:14:17,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:14:17,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:14:17,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:14:17,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:14:17,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:14:17,963 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:14:17,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:14:17,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:14:17,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:14:17,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:14:17,966 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:14:17,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:14:17,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:14:17,967 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:14:17,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:14:17,968 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:14:17,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:14:17,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:14:17,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:14:17,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:14:17,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:14:17,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:14:17,969 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:14:17,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:14:17,970 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:14:17,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:14:17,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:14:17,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:14:17,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:14:17,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:14:17,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:14:17,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:14:17,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:14:17,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:14:17,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:14:17,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:14:17,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:14:17,972 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:14:17,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:14:17,973 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:14:17,973 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:14:18,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:14:18,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:14:18,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:14:18,351 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:14:18,351 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:14:18,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-08-30 23:14:19,447 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:14:19,726 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:14:19,727 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2023-08-30 23:14:19,744 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fc991e6/054fb43b23a4489fbee56896a5e1fc74/FLAG808024ea1 [2023-08-30 23:14:19,765 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1fc991e6/054fb43b23a4489fbee56896a5e1fc74 [2023-08-30 23:14:19,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:14:19,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:14:19,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:14:19,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:14:19,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:14:19,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:14:19" (1/1) ... [2023-08-30 23:14:19,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192de5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:19, skipping insertion in model container [2023-08-30 23:14:19,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:14:19" (1/1) ... [2023-08-30 23:14:19,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:14:19,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:14:20,021 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2023-08-30 23:14:20,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:14:20,281 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:14:20,291 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i[949,962] [2023-08-30 23:14:20,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:14:20,411 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:14:20,411 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:14:20,417 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:14:20,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20 WrapperNode [2023-08-30 23:14:20,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:14:20,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:14:20,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:14:20,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:14:20,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,488 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-30 23:14:20,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:14:20,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:14:20,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:14:20,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:14:20,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:14:20,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:14:20,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:14:20,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:14:20,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (1/1) ... [2023-08-30 23:14:20,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:14:20,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:14:20,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 23:14:20,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 23:14:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:14:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:14:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:14:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:14:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:14:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:14:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:14:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:14:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:14:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:14:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:14:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:14:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:14:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:14:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:14:20,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:14:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:14:20,628 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:14:20,813 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:14:20,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:14:21,152 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:14:21,313 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:14:21,314 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:14:21,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:21 BoogieIcfgContainer [2023-08-30 23:14:21,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:14:21,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:14:21,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:14:21,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:14:21,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:14:19" (1/3) ... [2023-08-30 23:14:21,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b38ded0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:14:21, skipping insertion in model container [2023-08-30 23:14:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:14:20" (2/3) ... [2023-08-30 23:14:21,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b38ded0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:14:21, skipping insertion in model container [2023-08-30 23:14:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:21" (3/3) ... [2023-08-30 23:14:21,323 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-08-30 23:14:21,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:14:21,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:14:21,340 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:14:21,341 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:14:21,402 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:14:21,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 23:14:21,508 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 23:14:21,508 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:21,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:14:21,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 23:14:21,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-30 23:14:21,532 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:14:21,540 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 23:14:21,542 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 23:14:21,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-30 23:14:21,598 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 23:14:21,603 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:21,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 23:14:21,607 INFO L119 LiptonReduction]: Number of co-enabled transitions 3256 [2023-08-30 23:14:26,223 INFO L134 LiptonReduction]: Checked pairs total: 9032 [2023-08-30 23:14:26,224 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 23:14:26,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:14:26,242 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f83313, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:14:26,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:14:26,246 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 23:14:26,246 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:14:26,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:26,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 23:14:26,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:26,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 532873566, now seen corresponding path program 1 times [2023-08-30 23:14:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103205671] [2023-08-30 23:14:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103205671] [2023-08-30 23:14:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103205671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:14:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083066812] [2023-08-30 23:14:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:14:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:14:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:14:26,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-08-30 23:14:26,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:26,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:26,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-08-30 23:14:26,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:27,759 INFO L130 PetriNetUnfolder]: 4903/6853 cut-off events. [2023-08-30 23:14:27,759 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-30 23:14:27,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13701 conditions, 6853 events. 4903/6853 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34633 event pairs, 1733 based on Foata normal form. 0/6512 useless extension candidates. Maximal degree in co-relation 13689. Up to 5323 conditions per place. [2023-08-30 23:14:27,801 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-30 23:14:27,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 198 flow [2023-08-30 23:14:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:14:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:14:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-30 23:14:27,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377229080932785 [2023-08-30 23:14:27,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-30 23:14:27,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-30 23:14:27,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:27,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-30 23:14:27,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:27,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:27,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:27,836 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 392 transitions. [2023-08-30 23:14:27,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 198 flow [2023-08-30 23:14:27,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:27,843 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 23:14:27,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 23:14:27,851 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:14:27,852 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 23:14:27,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:27,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:27,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:27,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:14:27,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:27,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash -376863777, now seen corresponding path program 1 times [2023-08-30 23:14:27,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858665937] [2023-08-30 23:14:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858665937] [2023-08-30 23:14:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858665937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305346435] [2023-08-30 23:14:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:28,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:28,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 23:14:28,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:28,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:28,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 23:14:28,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:30,025 INFO L130 PetriNetUnfolder]: 8844/11946 cut-off events. [2023-08-30 23:14:30,025 INFO L131 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2023-08-30 23:14:30,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24793 conditions, 11946 events. 8844/11946 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 57351 event pairs, 1299 based on Foata normal form. 160/12105 useless extension candidates. Maximal degree in co-relation 24783. Up to 10168 conditions per place. [2023-08-30 23:14:30,091 INFO L137 encePairwiseOnDemand]: 230/243 looper letters, 44 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2023-08-30 23:14:30,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 254 flow [2023-08-30 23:14:30,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:14:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:14:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-30 23:14:30,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897119341563786 [2023-08-30 23:14:30,095 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-30 23:14:30,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-30 23:14:30,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:30,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-30 23:14:30,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:30,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:30,100 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:30,100 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 4 states and 476 transitions. [2023-08-30 23:14:30,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 254 flow [2023-08-30 23:14:30,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:30,103 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 155 flow [2023-08-30 23:14:30,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-08-30 23:14:30,104 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-30 23:14:30,104 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 155 flow [2023-08-30 23:14:30,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:30,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:30,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:30,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:14:30,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:30,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1202122654, now seen corresponding path program 1 times [2023-08-30 23:14:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261163059] [2023-08-30 23:14:30,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261163059] [2023-08-30 23:14:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261163059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:30,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:30,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220264983] [2023-08-30 23:14:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:30,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:30,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:30,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 23:14:30,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:30,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:30,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 23:14:30,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:31,714 INFO L130 PetriNetUnfolder]: 8265/11187 cut-off events. [2023-08-30 23:14:31,715 INFO L131 PetriNetUnfolder]: For 2885/2885 co-relation queries the response was YES. [2023-08-30 23:14:31,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31271 conditions, 11187 events. 8265/11187 cut-off events. For 2885/2885 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 53076 event pairs, 2319 based on Foata normal form. 160/11346 useless extension candidates. Maximal degree in co-relation 31259. Up to 7033 conditions per place. [2023-08-30 23:14:31,779 INFO L137 encePairwiseOnDemand]: 231/243 looper letters, 51 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2023-08-30 23:14:31,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 362 flow [2023-08-30 23:14:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:14:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:14:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-08-30 23:14:31,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835390946502058 [2023-08-30 23:14:31,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-08-30 23:14:31,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-08-30 23:14:31,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:31,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-08-30 23:14:31,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:31,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:31,786 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:31,787 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 155 flow. Second operand 4 states and 470 transitions. [2023-08-30 23:14:31,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 362 flow [2023-08-30 23:14:31,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 23:14:31,795 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 254 flow [2023-08-30 23:14:31,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-30 23:14:31,797 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2023-08-30 23:14:31,799 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 254 flow [2023-08-30 23:14:31,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:31,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:31,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:31,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:14:31,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:31,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:31,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1454752141, now seen corresponding path program 1 times [2023-08-30 23:14:31,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258864045] [2023-08-30 23:14:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:32,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258864045] [2023-08-30 23:14:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258864045] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:32,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:32,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191513035] [2023-08-30 23:14:32,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:32,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:32,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:32,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-08-30 23:14:32,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:32,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:32,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-08-30 23:14:32,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:33,555 INFO L130 PetriNetUnfolder]: 8408/11833 cut-off events. [2023-08-30 23:14:33,555 INFO L131 PetriNetUnfolder]: For 9619/9695 co-relation queries the response was YES. [2023-08-30 23:14:33,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36964 conditions, 11833 events. 8408/11833 cut-off events. For 9619/9695 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 64618 event pairs, 1856 based on Foata normal form. 110/11469 useless extension candidates. Maximal degree in co-relation 36947. Up to 9697 conditions per place. [2023-08-30 23:14:33,630 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 62 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-08-30 23:14:33,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 522 flow [2023-08-30 23:14:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:14:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:14:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-30 23:14:33,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377229080932785 [2023-08-30 23:14:33,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-30 23:14:33,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-30 23:14:33,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:33,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-30 23:14:33,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:33,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:33,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:33,636 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 254 flow. Second operand 3 states and 392 transitions. [2023-08-30 23:14:33,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 522 flow [2023-08-30 23:14:33,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 511 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:33,669 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 293 flow [2023-08-30 23:14:33,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-08-30 23:14:33,670 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-30 23:14:33,670 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 293 flow [2023-08-30 23:14:33,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:33,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:33,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:33,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:14:33,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:33,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2145966666, now seen corresponding path program 1 times [2023-08-30 23:14:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:33,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196978923] [2023-08-30 23:14:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196978923] [2023-08-30 23:14:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196978923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:14:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910897592] [2023-08-30 23:14:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:34,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:14:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:14:34,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:14:34,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-08-30 23:14:34,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:34,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:34,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-08-30 23:14:34,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:35,410 INFO L130 PetriNetUnfolder]: 8936/12565 cut-off events. [2023-08-30 23:14:35,411 INFO L131 PetriNetUnfolder]: For 10105/10290 co-relation queries the response was YES. [2023-08-30 23:14:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40134 conditions, 12565 events. 8936/12565 cut-off events. For 10105/10290 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 68885 event pairs, 1908 based on Foata normal form. 245/12320 useless extension candidates. Maximal degree in co-relation 40116. Up to 9610 conditions per place. [2023-08-30 23:14:35,486 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 79 selfloop transitions, 14 changer transitions 0/101 dead transitions. [2023-08-30 23:14:35,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 101 transitions, 715 flow [2023-08-30 23:14:35,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:14:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:14:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-30 23:14:35,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2023-08-30 23:14:35,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-30 23:14:35,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-30 23:14:35,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:35,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-30 23:14:35,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:35,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:35,493 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:35,494 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 293 flow. Second operand 4 states and 516 transitions. [2023-08-30 23:14:35,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 101 transitions, 715 flow [2023-08-30 23:14:35,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:35,515 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 405 flow [2023-08-30 23:14:35,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2023-08-30 23:14:35,516 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-30 23:14:35,517 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 405 flow [2023-08-30 23:14:35,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:35,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:35,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:35,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:14:35,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:35,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1561558364, now seen corresponding path program 1 times [2023-08-30 23:14:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678120367] [2023-08-30 23:14:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:35,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:35,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:35,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678120367] [2023-08-30 23:14:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678120367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:35,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:35,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:14:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333179986] [2023-08-30 23:14:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:35,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:35,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:35,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 243 [2023-08-30 23:14:35,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:35,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:35,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 243 [2023-08-30 23:14:35,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:37,287 INFO L130 PetriNetUnfolder]: 9046/12754 cut-off events. [2023-08-30 23:14:37,288 INFO L131 PetriNetUnfolder]: For 16897/17109 co-relation queries the response was YES. [2023-08-30 23:14:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45014 conditions, 12754 events. 9046/12754 cut-off events. For 16897/17109 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 70333 event pairs, 1296 based on Foata normal form. 222/12591 useless extension candidates. Maximal degree in co-relation 44994. Up to 9194 conditions per place. [2023-08-30 23:14:37,378 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 86 selfloop transitions, 22 changer transitions 0/116 dead transitions. [2023-08-30 23:14:37,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 116 transitions, 929 flow [2023-08-30 23:14:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:14:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:14:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-30 23:14:37,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360082304526749 [2023-08-30 23:14:37,384 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-30 23:14:37,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-30 23:14:37,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:37,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-30 23:14:37,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:37,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:37,390 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:37,390 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 405 flow. Second operand 4 states and 521 transitions. [2023-08-30 23:14:37,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 116 transitions, 929 flow [2023-08-30 23:14:37,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 116 transitions, 911 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:37,426 INFO L231 Difference]: Finished difference. Result has 54 places, 74 transitions, 579 flow [2023-08-30 23:14:37,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=579, PETRI_PLACES=54, PETRI_TRANSITIONS=74} [2023-08-30 23:14:37,428 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-30 23:14:37,428 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 74 transitions, 579 flow [2023-08-30 23:14:37,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:37,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:37,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:37,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:14:37,430 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:37,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1564058204, now seen corresponding path program 2 times [2023-08-30 23:14:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481514474] [2023-08-30 23:14:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481514474] [2023-08-30 23:14:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481514474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:14:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41412309] [2023-08-30 23:14:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:37,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:14:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:37,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:14:37,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:14:37,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 243 [2023-08-30 23:14:37,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 74 transitions, 579 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:37,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:37,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 243 [2023-08-30 23:14:37,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:39,115 INFO L130 PetriNetUnfolder]: 9123/12835 cut-off events. [2023-08-30 23:14:39,115 INFO L131 PetriNetUnfolder]: For 26338/26790 co-relation queries the response was YES. [2023-08-30 23:14:39,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49742 conditions, 12835 events. 9123/12835 cut-off events. For 26338/26790 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 70555 event pairs, 1344 based on Foata normal form. 425/12829 useless extension candidates. Maximal degree in co-relation 49721. Up to 9289 conditions per place. [2023-08-30 23:14:39,216 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 88 selfloop transitions, 30 changer transitions 0/126 dead transitions. [2023-08-30 23:14:39,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 126 transitions, 1140 flow [2023-08-30 23:14:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:14:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:14:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-30 23:14:39,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360082304526749 [2023-08-30 23:14:39,220 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-30 23:14:39,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-30 23:14:39,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:39,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-30 23:14:39,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:39,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:39,228 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:39,228 INFO L175 Difference]: Start difference. First operand has 54 places, 74 transitions, 579 flow. Second operand 4 states and 521 transitions. [2023-08-30 23:14:39,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 126 transitions, 1140 flow [2023-08-30 23:14:39,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 126 transitions, 1111 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:39,278 INFO L231 Difference]: Finished difference. Result has 57 places, 85 transitions, 762 flow [2023-08-30 23:14:39,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=762, PETRI_PLACES=57, PETRI_TRANSITIONS=85} [2023-08-30 23:14:39,279 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-30 23:14:39,279 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 85 transitions, 762 flow [2023-08-30 23:14:39,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:39,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:39,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:39,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:14:39,281 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:39,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1199061782, now seen corresponding path program 1 times [2023-08-30 23:14:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874339234] [2023-08-30 23:14:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:39,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:39,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874339234] [2023-08-30 23:14:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874339234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:39,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:39,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:14:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732845096] [2023-08-30 23:14:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:39,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:39,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:39,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-08-30 23:14:39,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 85 transitions, 762 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:39,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:39,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-08-30 23:14:39,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:41,075 INFO L130 PetriNetUnfolder]: 9560/13354 cut-off events. [2023-08-30 23:14:41,076 INFO L131 PetriNetUnfolder]: For 39916/40607 co-relation queries the response was YES. [2023-08-30 23:14:41,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54308 conditions, 13354 events. 9560/13354 cut-off events. For 39916/40607 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 70873 event pairs, 2151 based on Foata normal form. 696/13746 useless extension candidates. Maximal degree in co-relation 54285. Up to 9679 conditions per place. [2023-08-30 23:14:41,173 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 98 selfloop transitions, 40 changer transitions 0/146 dead transitions. [2023-08-30 23:14:41,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 146 transitions, 1409 flow [2023-08-30 23:14:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-30 23:14:41,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275720164609053 [2023-08-30 23:14:41,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-30 23:14:41,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-30 23:14:41,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:41,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-30 23:14:41,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:41,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:41,181 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:41,181 INFO L175 Difference]: Start difference. First operand has 57 places, 85 transitions, 762 flow. Second operand 5 states and 641 transitions. [2023-08-30 23:14:41,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 146 transitions, 1409 flow [2023-08-30 23:14:41,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 146 transitions, 1376 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:41,231 INFO L231 Difference]: Finished difference. Result has 61 places, 95 transitions, 963 flow [2023-08-30 23:14:41,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=963, PETRI_PLACES=61, PETRI_TRANSITIONS=95} [2023-08-30 23:14:41,231 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-30 23:14:41,232 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 95 transitions, 963 flow [2023-08-30 23:14:41,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:41,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:41,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:41,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:14:41,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:41,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:41,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1163671237, now seen corresponding path program 1 times [2023-08-30 23:14:41,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273889678] [2023-08-30 23:14:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:41,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:41,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273889678] [2023-08-30 23:14:41,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273889678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:41,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:41,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:14:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731255803] [2023-08-30 23:14:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:41,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:41,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:41,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:41,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:41,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-08-30 23:14:41,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 95 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:41,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:41,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-08-30 23:14:41,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:43,035 INFO L130 PetriNetUnfolder]: 10241/14238 cut-off events. [2023-08-30 23:14:43,036 INFO L131 PetriNetUnfolder]: For 57737/58758 co-relation queries the response was YES. [2023-08-30 23:14:43,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61399 conditions, 14238 events. 10241/14238 cut-off events. For 57737/58758 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 76122 event pairs, 2515 based on Foata normal form. 850/14750 useless extension candidates. Maximal degree in co-relation 61374. Up to 10099 conditions per place. [2023-08-30 23:14:43,135 INFO L137 encePairwiseOnDemand]: 234/243 looper letters, 112 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2023-08-30 23:14:43,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 161 transitions, 1684 flow [2023-08-30 23:14:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-30 23:14:43,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234567901234568 [2023-08-30 23:14:43,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-30 23:14:43,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-30 23:14:43,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:43,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-30 23:14:43,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:43,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:43,143 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:43,143 INFO L175 Difference]: Start difference. First operand has 61 places, 95 transitions, 963 flow. Second operand 5 states and 636 transitions. [2023-08-30 23:14:43,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 161 transitions, 1684 flow [2023-08-30 23:14:43,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 161 transitions, 1594 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 23:14:43,205 INFO L231 Difference]: Finished difference. Result has 63 places, 106 transitions, 1124 flow [2023-08-30 23:14:43,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1124, PETRI_PLACES=63, PETRI_TRANSITIONS=106} [2023-08-30 23:14:43,206 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-08-30 23:14:43,207 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 106 transitions, 1124 flow [2023-08-30 23:14:43,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:43,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:43,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:43,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:14:43,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:43,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1241166277, now seen corresponding path program 2 times [2023-08-30 23:14:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914968731] [2023-08-30 23:14:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914968731] [2023-08-30 23:14:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914968731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:14:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992865144] [2023-08-30 23:14:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:43,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:43,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:43,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-08-30 23:14:43,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 106 transitions, 1124 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:43,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:43,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-08-30 23:14:43,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:45,348 INFO L130 PetriNetUnfolder]: 11755/16361 cut-off events. [2023-08-30 23:14:45,351 INFO L131 PetriNetUnfolder]: For 82054/83124 co-relation queries the response was YES. [2023-08-30 23:14:45,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74868 conditions, 16361 events. 11755/16361 cut-off events. For 82054/83124 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 90736 event pairs, 1955 based on Foata normal form. 923/16721 useless extension candidates. Maximal degree in co-relation 74842. Up to 11017 conditions per place. [2023-08-30 23:14:45,484 INFO L137 encePairwiseOnDemand]: 234/243 looper letters, 142 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2023-08-30 23:14:45,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 194 transitions, 2224 flow [2023-08-30 23:14:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-30 23:14:45,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5275720164609053 [2023-08-30 23:14:45,487 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-30 23:14:45,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-30 23:14:45,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:45,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-30 23:14:45,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:45,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:45,492 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:45,492 INFO L175 Difference]: Start difference. First operand has 63 places, 106 transitions, 1124 flow. Second operand 5 states and 641 transitions. [2023-08-30 23:14:45,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 194 transitions, 2224 flow [2023-08-30 23:14:45,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 194 transitions, 2061 flow, removed 42 selfloop flow, removed 3 redundant places. [2023-08-30 23:14:45,655 INFO L231 Difference]: Finished difference. Result has 66 places, 131 transitions, 1495 flow [2023-08-30 23:14:45,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1495, PETRI_PLACES=66, PETRI_TRANSITIONS=131} [2023-08-30 23:14:45,656 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-30 23:14:45,656 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 131 transitions, 1495 flow [2023-08-30 23:14:45,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:45,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:45,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:45,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:14:45,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:45,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1792374716, now seen corresponding path program 1 times [2023-08-30 23:14:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571426023] [2023-08-30 23:14:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:46,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571426023] [2023-08-30 23:14:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571426023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:14:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144142473] [2023-08-30 23:14:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:46,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 243 [2023-08-30 23:14:46,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 131 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:46,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:46,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 243 [2023-08-30 23:14:46,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:48,087 INFO L130 PetriNetUnfolder]: 13089/18191 cut-off events. [2023-08-30 23:14:48,087 INFO L131 PetriNetUnfolder]: For 122595/124106 co-relation queries the response was YES. [2023-08-30 23:14:48,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91309 conditions, 18191 events. 13089/18191 cut-off events. For 122595/124106 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 102498 event pairs, 2046 based on Foata normal form. 1325/18964 useless extension candidates. Maximal degree in co-relation 91281. Up to 11124 conditions per place. [2023-08-30 23:14:48,176 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 136 selfloop transitions, 65 changer transitions 0/209 dead transitions. [2023-08-30 23:14:48,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 2519 flow [2023-08-30 23:14:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:14:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:14:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-30 23:14:48,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5212620027434842 [2023-08-30 23:14:48,179 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-30 23:14:48,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-30 23:14:48,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:48,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-30 23:14:48,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:48,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:48,184 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:48,184 INFO L175 Difference]: Start difference. First operand has 66 places, 131 transitions, 1495 flow. Second operand 6 states and 760 transitions. [2023-08-30 23:14:48,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 2519 flow [2023-08-30 23:14:48,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 209 transitions, 2390 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-30 23:14:48,406 INFO L231 Difference]: Finished difference. Result has 70 places, 142 transitions, 1752 flow [2023-08-30 23:14:48,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1366, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1752, PETRI_PLACES=70, PETRI_TRANSITIONS=142} [2023-08-30 23:14:48,407 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2023-08-30 23:14:48,407 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 142 transitions, 1752 flow [2023-08-30 23:14:48,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:48,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:48,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:48,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:14:48,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:48,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash 689555593, now seen corresponding path program 1 times [2023-08-30 23:14:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:48,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446080979] [2023-08-30 23:14:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:48,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446080979] [2023-08-30 23:14:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446080979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:48,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:14:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153644018] [2023-08-30 23:14:48,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:48,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:14:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:14:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:14:48,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:14:48,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 142 transitions, 1752 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:48,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:48,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:14:48,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:49,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:49,353 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,353 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,353 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,353 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:49,354 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,354 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,355 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,355 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,355 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,355 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,355 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:49,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:49,539 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:49,540 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,540 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][167], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:49,541 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,541 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,542 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,542 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,543 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][259], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,543 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,543 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,543 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,543 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,544 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][204], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,544 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,544 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,544 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,545 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,546 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,546 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,546 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,546 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,547 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,547 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,547 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,547 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,547 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][256], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,548 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,548 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,548 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,548 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,549 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,549 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,549 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,550 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,550 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,550 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,551 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,551 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,551 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,551 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:49,687 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][300], [60#L786true, Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,687 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,687 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,688 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,688 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][259], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,688 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,688 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,689 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,689 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,689 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][204], [60#L786true, Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,689 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,689 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,736 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,737 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,820 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,820 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,820 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,820 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,820 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][256], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, P1Thread1of1ForFork3InUse, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:49,821 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,821 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,821 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:49,821 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:50,242 INFO L130 PetriNetUnfolder]: 10720/14795 cut-off events. [2023-08-30 23:14:50,242 INFO L131 PetriNetUnfolder]: For 175017/179260 co-relation queries the response was YES. [2023-08-30 23:14:50,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82854 conditions, 14795 events. 10720/14795 cut-off events. For 175017/179260 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 83716 event pairs, 1415 based on Foata normal form. 3230/17264 useless extension candidates. Maximal degree in co-relation 82825. Up to 9327 conditions per place. [2023-08-30 23:14:50,319 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 348 selfloop transitions, 10 changer transitions 4/374 dead transitions. [2023-08-30 23:14:50,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 374 transitions, 5478 flow [2023-08-30 23:14:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:14:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:14:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-30 23:14:50,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160493827160494 [2023-08-30 23:14:50,321 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-30 23:14:50,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-30 23:14:50,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:50,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-30 23:14:50,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:50,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:50,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:50,326 INFO L175 Difference]: Start difference. First operand has 70 places, 142 transitions, 1752 flow. Second operand 5 states and 627 transitions. [2023-08-30 23:14:50,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 374 transitions, 5478 flow [2023-08-30 23:14:50,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 374 transitions, 5160 flow, removed 133 selfloop flow, removed 3 redundant places. [2023-08-30 23:14:50,457 INFO L231 Difference]: Finished difference. Result has 74 places, 141 transitions, 1614 flow [2023-08-30 23:14:50,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1614, PETRI_PLACES=74, PETRI_TRANSITIONS=141} [2023-08-30 23:14:50,458 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-30 23:14:50,458 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 141 transitions, 1614 flow [2023-08-30 23:14:50,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:50,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:50,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:50,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:14:50,459 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:50,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -312344570, now seen corresponding path program 1 times [2023-08-30 23:14:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744292631] [2023-08-30 23:14:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744292631] [2023-08-30 23:14:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744292631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:14:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822742844] [2023-08-30 23:14:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:50,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:14:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:14:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:14:50,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:14:50,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 141 transitions, 1614 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:50,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:50,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:14:50,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:51,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:51,456 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,456 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,456 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,456 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,457 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:51,457 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,457 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,457 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,457 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,458 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,458 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,458 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,458 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,459 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,459 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,459 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,459 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,459 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:51,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:51,630 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,630 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,630 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,630 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][168], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:51,631 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1))]) [2023-08-30 23:14:51,631 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,631 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,632 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,632 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,632 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,632 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,632 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,633 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,633 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,633 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,633 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,634 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,635 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][263], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,635 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,636 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,638 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,638 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,638 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,639 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,639 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,639 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,640 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:51,802 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][310], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,802 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,802 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,802 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,802 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,803 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,803 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,803 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,803 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,803 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,803 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,804 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,804 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,804 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,804 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,805 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][310], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,805 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,805 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,805 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,805 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][264], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,806 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,806 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,806 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,806 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 234#true, 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue]) [2023-08-30 23:14:51,806 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,807 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,807 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:51,807 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:52,191 INFO L130 PetriNetUnfolder]: 8627/12033 cut-off events. [2023-08-30 23:14:52,191 INFO L131 PetriNetUnfolder]: For 126328/130244 co-relation queries the response was YES. [2023-08-30 23:14:52,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68576 conditions, 12033 events. 8627/12033 cut-off events. For 126328/130244 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 67523 event pairs, 705 based on Foata normal form. 2608/13985 useless extension candidates. Maximal degree in co-relation 68544. Up to 7266 conditions per place. [2023-08-30 23:14:52,256 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 407 selfloop transitions, 19 changer transitions 19/457 dead transitions. [2023-08-30 23:14:52,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 457 transitions, 6327 flow [2023-08-30 23:14:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:14:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:14:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-30 23:14:52,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173427395649618 [2023-08-30 23:14:52,259 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-30 23:14:52,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-30 23:14:52,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:52,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-30 23:14:52,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:52,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:52,265 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:52,265 INFO L175 Difference]: Start difference. First operand has 74 places, 141 transitions, 1614 flow. Second operand 7 states and 880 transitions. [2023-08-30 23:14:52,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 457 transitions, 6327 flow [2023-08-30 23:14:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 457 transitions, 6322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:14:52,422 INFO L231 Difference]: Finished difference. Result has 82 places, 138 transitions, 1599 flow [2023-08-30 23:14:52,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1599, PETRI_PLACES=82, PETRI_TRANSITIONS=138} [2023-08-30 23:14:52,423 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-30 23:14:52,424 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 138 transitions, 1599 flow [2023-08-30 23:14:52,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:52,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:52,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:52,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:14:52,425 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:52,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1713990753, now seen corresponding path program 1 times [2023-08-30 23:14:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28519238] [2023-08-30 23:14:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28519238] [2023-08-30 23:14:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28519238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:52,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:14:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082450715] [2023-08-30 23:14:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:52,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:14:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:14:52,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:14:52,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:14:52,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 138 transitions, 1599 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:52,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:52,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:14:52,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:53,572 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,573 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,573 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,573 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 23:14:53,574 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,574 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,574 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,574 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 23:14:53,575 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,575 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,575 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,575 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 23:14:53,737 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][87], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,737 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,737 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,737 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,737 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][169], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,738 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][88], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 113#L813true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 250#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 264#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,738 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,738 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,739 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,739 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,740 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,740 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,740 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,740 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][127], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 23:14:53,741 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][265], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 260#(<= ~__unbuffered_cnt~0 1), 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 23:14:53,741 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,741 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][43], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 60#L786true, 247#(<= ~__unbuffered_cnt~0 1), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, 260#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 21#L863-3true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)]) [2023-08-30 23:14:53,742 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,742 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,743 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,743 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,743 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,743 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,743 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 27#L829true, Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,743 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,743 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,744 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,744 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-30 23:14:53,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][312], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,840 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,840 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,840 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,840 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,840 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,841 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,841 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_137 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_128 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= v_~x~0_89 (ite .cse4 v_~x$w_buff0~0_60 (ite .cse1 v_~x$w_buff1~0_55 v_~x~0_90)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][312], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 61#L839true, Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,842 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,842 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,842 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,842 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L786-->L793: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_79 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_53 (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54))) (= v_~x$w_buff1_used~0_78 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_79)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22) (= v_~x$r_buff1_thd2~0_15 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_78 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][266], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 110#L793true, Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 125#L756true, 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,843 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_143 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_143) v_~x$w_buff1_used~0_142) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_67 v_~x~0_108)) v_~x~0_107) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_142 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_143, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_142, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][209], [Black: 189#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), 60#L786true, 157#true, Black: 200#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff1_thd1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff1_thd1~0 (* 256 (div ~x$r_buff1_thd1~0 256)))), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, 119#L763true, P3Thread1of1ForFork2InUse, 225#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= ~x$r_buff0_thd0~0 0)), Black: 208#(and (< 0 (+ (div ~x$w_buff1_used~0 256) 1)) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 153#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 218#(and (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= ~x~0 1) (not (= 2 ~x$w_buff1~0))), Black: 216#(and (not (= 2 ~x$w_buff0~0)) (<= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (<= ~x$r_buff0_thd0~0 0) (<= 0 ~x$w_buff1_used~0)), 121#L832true, 72#L2true, Black: 160#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 226#(and (= ~x$w_buff1_used~0 0) (<= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd0~0) (< 0 (+ ~x$r_buff1_thd0~0 1)) (= ~x~0 1) (<= ~x$r_buff0_thd0~0 0)), Black: 167#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 0 ~x$w_buff0~0) (<= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (<= 0 ~x$w_buff1_used~0)), 266#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 252#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 150#true, Black: 236#(<= ~__unbuffered_cnt~0 0), Black: 239#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 237#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), 64#P2EXITtrue, Black: 248#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 247#(<= ~__unbuffered_cnt~0 1)]) [2023-08-30 23:14:53,843 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:53,843 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-30 23:14:54,149 INFO L130 PetriNetUnfolder]: 8104/11219 cut-off events. [2023-08-30 23:14:54,149 INFO L131 PetriNetUnfolder]: For 124594/128382 co-relation queries the response was YES. [2023-08-30 23:14:54,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67368 conditions, 11219 events. 8104/11219 cut-off events. For 124594/128382 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 62265 event pairs, 568 based on Foata normal form. 2078/12663 useless extension candidates. Maximal degree in co-relation 67332. Up to 6679 conditions per place. [2023-08-30 23:14:54,215 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 413 selfloop transitions, 28 changer transitions 34/487 dead transitions. [2023-08-30 23:14:54,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 487 transitions, 6767 flow [2023-08-30 23:14:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:14:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:14:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1131 transitions. [2023-08-30 23:14:54,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171467764060357 [2023-08-30 23:14:54,218 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1131 transitions. [2023-08-30 23:14:54,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1131 transitions. [2023-08-30 23:14:54,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:54,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1131 transitions. [2023-08-30 23:14:54,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:54,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:54,223 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:54,223 INFO L175 Difference]: Start difference. First operand has 82 places, 138 transitions, 1599 flow. Second operand 9 states and 1131 transitions. [2023-08-30 23:14:54,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 487 transitions, 6767 flow [2023-08-30 23:14:54,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 487 transitions, 6330 flow, removed 129 selfloop flow, removed 6 redundant places. [2023-08-30 23:14:54,679 INFO L231 Difference]: Finished difference. Result has 87 places, 140 transitions, 1550 flow [2023-08-30 23:14:54,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1550, PETRI_PLACES=87, PETRI_TRANSITIONS=140} [2023-08-30 23:14:54,680 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-08-30 23:14:54,680 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 140 transitions, 1550 flow [2023-08-30 23:14:54,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:54,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:54,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:54,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:14:54,681 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:54,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1562489526, now seen corresponding path program 1 times [2023-08-30 23:14:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109273510] [2023-08-30 23:14:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109273510] [2023-08-30 23:14:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109273510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:14:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244520308] [2023-08-30 23:14:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:55,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:14:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:14:55,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:14:55,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 243 [2023-08-30 23:14:55,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 140 transitions, 1550 flow. Second operand has 8 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:55,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:55,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 243 [2023-08-30 23:14:55,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:14:57,975 INFO L130 PetriNetUnfolder]: 14705/20962 cut-off events. [2023-08-30 23:14:57,976 INFO L131 PetriNetUnfolder]: For 115665/115665 co-relation queries the response was YES. [2023-08-30 23:14:58,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113817 conditions, 20962 events. 14705/20962 cut-off events. For 115665/115665 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 122830 event pairs, 1765 based on Foata normal form. 13/20975 useless extension candidates. Maximal degree in co-relation 113780. Up to 10215 conditions per place. [2023-08-30 23:14:58,132 INFO L137 encePairwiseOnDemand]: 228/243 looper letters, 189 selfloop transitions, 131 changer transitions 259/579 dead transitions. [2023-08-30 23:14:58,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 579 transitions, 6890 flow [2023-08-30 23:14:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 23:14:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 23:14:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1612 transitions. [2023-08-30 23:14:58,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738389182833627 [2023-08-30 23:14:58,136 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1612 transitions. [2023-08-30 23:14:58,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1612 transitions. [2023-08-30 23:14:58,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:14:58,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1612 transitions. [2023-08-30 23:14:58,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.14285714285714) internal successors, (1612), 14 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 243.0) internal successors, (3645), 15 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,145 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 243.0) internal successors, (3645), 15 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:58,145 INFO L175 Difference]: Start difference. First operand has 87 places, 140 transitions, 1550 flow. Second operand 14 states and 1612 transitions. [2023-08-30 23:14:58,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 579 transitions, 6890 flow [2023-08-30 23:14:59,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 579 transitions, 6165 flow, removed 232 selfloop flow, removed 4 redundant places. [2023-08-30 23:14:59,492 INFO L231 Difference]: Finished difference. Result has 105 places, 193 transitions, 2534 flow [2023-08-30 23:14:59,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2534, PETRI_PLACES=105, PETRI_TRANSITIONS=193} [2023-08-30 23:14:59,493 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places. [2023-08-30 23:14:59,493 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 193 transitions, 2534 flow [2023-08-30 23:14:59,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:59,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:14:59,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:14:59,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:14:59,494 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:14:59,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:14:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1468939936, now seen corresponding path program 2 times [2023-08-30 23:14:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:14:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791714817] [2023-08-30 23:14:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:14:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:14:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:14:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:14:59,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:14:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791714817] [2023-08-30 23:14:59,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791714817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:14:59,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:14:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:14:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145356134] [2023-08-30 23:14:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:14:59,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:14:59,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:14:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:14:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:14:59,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:14:59,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 193 transitions, 2534 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:14:59,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:14:59,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:14:59,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:00,616 INFO L130 PetriNetUnfolder]: 3995/5818 cut-off events. [2023-08-30 23:15:00,616 INFO L131 PetriNetUnfolder]: For 49265/50213 co-relation queries the response was YES. [2023-08-30 23:15:00,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34227 conditions, 5818 events. 3995/5818 cut-off events. For 49265/50213 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31356 event pairs, 468 based on Foata normal form. 423/5965 useless extension candidates. Maximal degree in co-relation 34180. Up to 3466 conditions per place. [2023-08-30 23:15:00,646 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 253 selfloop transitions, 18 changer transitions 85/378 dead transitions. [2023-08-30 23:15:00,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 378 transitions, 5596 flow [2023-08-30 23:15:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:15:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:15:00,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 979 transitions. [2023-08-30 23:15:00,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036008230452675 [2023-08-30 23:15:00,649 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 979 transitions. [2023-08-30 23:15:00,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 979 transitions. [2023-08-30 23:15:00,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:00,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 979 transitions. [2023-08-30 23:15:00,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:00,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:00,655 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:00,655 INFO L175 Difference]: Start difference. First operand has 105 places, 193 transitions, 2534 flow. Second operand 8 states and 979 transitions. [2023-08-30 23:15:00,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 378 transitions, 5596 flow [2023-08-30 23:15:00,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 378 transitions, 5234 flow, removed 155 selfloop flow, removed 8 redundant places. [2023-08-30 23:15:00,781 INFO L231 Difference]: Finished difference. Result has 99 places, 151 transitions, 1817 flow [2023-08-30 23:15:00,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=2272, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1817, PETRI_PLACES=99, PETRI_TRANSITIONS=151} [2023-08-30 23:15:00,782 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2023-08-30 23:15:00,782 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 151 transitions, 1817 flow [2023-08-30 23:15:00,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:00,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:00,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 23:15:00,783 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:00,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1043029499, now seen corresponding path program 1 times [2023-08-30 23:15:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:00,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221701697] [2023-08-30 23:15:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221701697] [2023-08-30 23:15:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221701697] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:01,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:01,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:15:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697139902] [2023-08-30 23:15:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:01,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:15:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:15:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:15:01,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 243 [2023-08-30 23:15:01,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 151 transitions, 1817 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:01,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:01,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 243 [2023-08-30 23:15:01,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:02,270 INFO L130 PetriNetUnfolder]: 4391/6697 cut-off events. [2023-08-30 23:15:02,271 INFO L131 PetriNetUnfolder]: For 36535/36970 co-relation queries the response was YES. [2023-08-30 23:15:02,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37460 conditions, 6697 events. 4391/6697 cut-off events. For 36535/36970 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38686 event pairs, 482 based on Foata normal form. 271/6949 useless extension candidates. Maximal degree in co-relation 37427. Up to 3347 conditions per place. [2023-08-30 23:15:02,300 INFO L137 encePairwiseOnDemand]: 230/243 looper letters, 117 selfloop transitions, 54 changer transitions 126/301 dead transitions. [2023-08-30 23:15:02,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 301 transitions, 3958 flow [2023-08-30 23:15:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:15:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:15:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2023-08-30 23:15:02,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48010973936899864 [2023-08-30 23:15:02,303 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2023-08-30 23:15:02,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2023-08-30 23:15:02,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:02,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2023-08-30 23:15:02,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,314 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,314 INFO L175 Difference]: Start difference. First operand has 99 places, 151 transitions, 1817 flow. Second operand 6 states and 700 transitions. [2023-08-30 23:15:02,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 301 transitions, 3958 flow [2023-08-30 23:15:02,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 301 transitions, 3759 flow, removed 42 selfloop flow, removed 9 redundant places. [2023-08-30 23:15:02,466 INFO L231 Difference]: Finished difference. Result has 97 places, 124 transitions, 1538 flow [2023-08-30 23:15:02,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1538, PETRI_PLACES=97, PETRI_TRANSITIONS=124} [2023-08-30 23:15:02,466 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2023-08-30 23:15:02,467 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 124 transitions, 1538 flow [2023-08-30 23:15:02,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:02,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:02,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:02,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 23:15:02,467 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:02,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1899330447, now seen corresponding path program 2 times [2023-08-30 23:15:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104280328] [2023-08-30 23:15:02,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:02,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104280328] [2023-08-30 23:15:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104280328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:02,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:15:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382609837] [2023-08-30 23:15:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:02,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:15:02,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:15:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:15:03,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 243 [2023-08-30 23:15:03,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 124 transitions, 1538 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:03,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:03,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 243 [2023-08-30 23:15:03,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:03,809 INFO L130 PetriNetUnfolder]: 4456/7053 cut-off events. [2023-08-30 23:15:03,809 INFO L131 PetriNetUnfolder]: For 38038/38372 co-relation queries the response was YES. [2023-08-30 23:15:03,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38253 conditions, 7053 events. 4456/7053 cut-off events. For 38038/38372 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 43575 event pairs, 1300 based on Foata normal form. 229/7251 useless extension candidates. Maximal degree in co-relation 38210. Up to 3631 conditions per place. [2023-08-30 23:15:03,841 INFO L137 encePairwiseOnDemand]: 238/243 looper letters, 57 selfloop transitions, 5 changer transitions 118/182 dead transitions. [2023-08-30 23:15:03,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 2379 flow [2023-08-30 23:15:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:15:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:15:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-30 23:15:03,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2023-08-30 23:15:03,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-30 23:15:03,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-30 23:15:03,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:03,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-30 23:15:03,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:03,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:03,846 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:03,846 INFO L175 Difference]: Start difference. First operand has 97 places, 124 transitions, 1538 flow. Second operand 4 states and 471 transitions. [2023-08-30 23:15:03,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 2379 flow [2023-08-30 23:15:04,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 182 transitions, 2259 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 23:15:04,046 INFO L231 Difference]: Finished difference. Result has 94 places, 52 transitions, 392 flow [2023-08-30 23:15:04,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=94, PETRI_TRANSITIONS=52} [2023-08-30 23:15:04,047 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2023-08-30 23:15:04,047 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 52 transitions, 392 flow [2023-08-30 23:15:04,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:04,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:04,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 23:15:04,048 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:04,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash -243540721, now seen corresponding path program 3 times [2023-08-30 23:15:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173128836] [2023-08-30 23:15:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173128836] [2023-08-30 23:15:06,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173128836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:06,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 23:15:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915907282] [2023-08-30 23:15:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:06,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 23:15:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 23:15:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 23:15:06,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 243 [2023-08-30 23:15:06,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 52 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 100.8) internal successors, (1008), 10 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:06,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:06,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 243 [2023-08-30 23:15:06,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:07,530 INFO L130 PetriNetUnfolder]: 1484/2415 cut-off events. [2023-08-30 23:15:07,530 INFO L131 PetriNetUnfolder]: For 8761/8761 co-relation queries the response was YES. [2023-08-30 23:15:07,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11426 conditions, 2415 events. 1484/2415 cut-off events. For 8761/8761 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11979 event pairs, 150 based on Foata normal form. 1/2416 useless extension candidates. Maximal degree in co-relation 11400. Up to 1009 conditions per place. [2023-08-30 23:15:07,539 INFO L137 encePairwiseOnDemand]: 233/243 looper letters, 94 selfloop transitions, 20 changer transitions 26/140 dead transitions. [2023-08-30 23:15:07,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 140 transitions, 1256 flow [2023-08-30 23:15:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:15:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:15:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 872 transitions. [2023-08-30 23:15:07,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448559670781893 [2023-08-30 23:15:07,541 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 872 transitions. [2023-08-30 23:15:07,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 872 transitions. [2023-08-30 23:15:07,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:07,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 872 transitions. [2023-08-30 23:15:07,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,546 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,546 INFO L175 Difference]: Start difference. First operand has 94 places, 52 transitions, 392 flow. Second operand 8 states and 872 transitions. [2023-08-30 23:15:07,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 140 transitions, 1256 flow [2023-08-30 23:15:07,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 140 transitions, 1058 flow, removed 49 selfloop flow, removed 22 redundant places. [2023-08-30 23:15:07,582 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 410 flow [2023-08-30 23:15:07,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-08-30 23:15:07,583 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-08-30 23:15:07,583 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 410 flow [2023-08-30 23:15:07,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.8) internal successors, (1008), 10 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:07,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:07,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:07,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 23:15:07,584 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:07,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash -488113921, now seen corresponding path program 4 times [2023-08-30 23:15:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:07,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097585907] [2023-08-30 23:15:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:07,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:15:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:15:09,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:15:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097585907] [2023-08-30 23:15:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097585907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:15:09,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:15:09,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 23:15:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783235163] [2023-08-30 23:15:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:15:09,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 23:15:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:15:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 23:15:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 23:15:09,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-08-30 23:15:09,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 410 flow. Second operand has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:09,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:15:09,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-08-30 23:15:09,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:15:09,605 INFO L130 PetriNetUnfolder]: 1506/2471 cut-off events. [2023-08-30 23:15:09,605 INFO L131 PetriNetUnfolder]: For 7110/7115 co-relation queries the response was YES. [2023-08-30 23:15:09,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10715 conditions, 2471 events. 1506/2471 cut-off events. For 7110/7115 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12329 event pairs, 210 based on Foata normal form. 1/2461 useless extension candidates. Maximal degree in co-relation 10696. Up to 866 conditions per place. [2023-08-30 23:15:09,612 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 82 selfloop transitions, 8 changer transitions 64/157 dead transitions. [2023-08-30 23:15:09,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 157 transitions, 1305 flow [2023-08-30 23:15:09,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:15:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:15:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2023-08-30 23:15:09,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2023-08-30 23:15:09,614 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2023-08-30 23:15:09,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2023-08-30 23:15:09,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:15:09,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2023-08-30 23:15:09,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:09,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:09,618 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:09,618 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 410 flow. Second operand 7 states and 864 transitions. [2023-08-30 23:15:09,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 157 transitions, 1305 flow [2023-08-30 23:15:09,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 157 transitions, 1300 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:15:09,650 INFO L231 Difference]: Finished difference. Result has 77 places, 58 transitions, 448 flow [2023-08-30 23:15:09,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=448, PETRI_PLACES=77, PETRI_TRANSITIONS=58} [2023-08-30 23:15:09,651 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-08-30 23:15:09,651 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 58 transitions, 448 flow [2023-08-30 23:15:09,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:15:09,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:15:09,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:09,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 23:15:09,652 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:15:09,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:15:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -909790857, now seen corresponding path program 5 times [2023-08-30 23:15:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:15:09,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818508273] [2023-08-30 23:15:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:15:09,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:15:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:15:09,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:15:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:15:09,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:15:09,790 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:15:09,790 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:15:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:15:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:15:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:15:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:15:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:15:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:15:09,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 23:15:09,794 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:15:09,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:15:09,800 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:15:09,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:15:09 BasicIcfg [2023-08-30 23:15:09,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:15:09,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:15:09,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:15:09,869 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:15:09,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:14:21" (3/4) ... [2023-08-30 23:15:09,871 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:15:09,969 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:15:09,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:15:09,970 INFO L158 Benchmark]: Toolchain (without parser) took 50201.87ms. Allocated memory was 73.4MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 50.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 964.3MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,971 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:15:09,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.11ms. Allocated memory is still 73.4MB. Free memory was 50.0MB in the beginning and 44.4MB in the end (delta: 5.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.04ms. Allocated memory is still 73.4MB. Free memory was 44.4MB in the beginning and 41.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,971 INFO L158 Benchmark]: Boogie Preprocessor took 53.54ms. Allocated memory is still 73.4MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,972 INFO L158 Benchmark]: RCFGBuilder took 766.36ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.5MB in the beginning and 57.1MB in the end (delta: -17.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,972 INFO L158 Benchmark]: TraceAbstraction took 48550.15ms. Allocated memory was 88.1MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 56.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 936.2MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,972 INFO L158 Benchmark]: Witness Printer took 101.13ms. Allocated memory is still 3.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 23:15:09,974 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.11ms. Allocated memory is still 73.4MB. Free memory was 50.0MB in the beginning and 44.4MB in the end (delta: 5.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.04ms. Allocated memory is still 73.4MB. Free memory was 44.4MB in the beginning and 41.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.54ms. Allocated memory is still 73.4MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.36ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 39.5MB in the beginning and 57.1MB in the end (delta: -17.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 48550.15ms. Allocated memory was 88.1MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 56.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 936.2MB. Max. memory is 16.1GB. * Witness Printer took 101.13ms. Allocated memory is still 3.1GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 30 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 9032 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3585, independent: 3344, independent conditional: 0, independent unconditional: 3344, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1760, independent: 1717, independent conditional: 0, independent unconditional: 1717, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3585, independent: 1627, independent conditional: 0, independent unconditional: 1627, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 1760, unknown conditional: 0, unknown unconditional: 1760] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-1, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=0, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=1, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=2, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1359 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1167 mSDsluCounter, 608 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 464 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3416 IncrementalHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 144 mSDtfsCounter, 3416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.2s 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.7s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 6224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:15:10,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE