/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:35:04,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:35:04,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:35:04,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:35:04,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:35:04,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:35:04,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:35:04,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:35:04,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:35:04,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:35:04,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:35:04,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:35:04,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:35:04,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:35:04,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:35:04,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:35:04,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:35:04,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:35:04,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:35:04,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:35:04,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:35:04,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:35:04,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:35:04,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:35:04,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:35:04,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:35:04,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:35:04,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:35:04,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:35:04,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:35:04,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:35:04,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:35:04,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:35:04,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:35:04,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:35:04,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:35:04,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:35:04,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:35:04,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:35:04,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:35:04,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:35:04,824 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:35:04,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:35:04,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:35:04,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:35:04,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:35:04,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:35:04,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:35:04,859 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:35:04,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:35:04,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:35:04,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:35:04,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:35:04,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:35:04,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:35:04,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:35:04,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:35:04,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:35:04,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:35:04,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:35:04,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:35:04,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:35:04,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:35:04,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:35:04,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:35:04,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:35:04,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:35:04,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:35:04,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:35:04,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:35:04,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:35:04,862 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:35:04,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:35:04,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:35:05,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:35:05,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:35:05,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:35:05,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:35:05,216 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:35:05,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 16:35:06,298 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:35:06,556 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:35:06,556 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 16:35:06,573 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5908ceaec/673211e7de384d23a8b723caaf6c3588/FLAG09af4c949 [2022-12-06 16:35:06,585 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5908ceaec/673211e7de384d23a8b723caaf6c3588 [2022-12-06 16:35:06,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:35:06,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:35:06,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:35:06,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:35:06,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:35:06,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:06" (1/1) ... [2022-12-06 16:35:06,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbdba51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:06, skipping insertion in model container [2022-12-06 16:35:06,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:06" (1/1) ... [2022-12-06 16:35:06,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:35:06,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:35:06,819 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-12-06 16:35:07,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:35:07,076 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:35:07,089 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-12-06 16:35:07,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:35:07,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:35:07,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:35:07,197 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:35:07,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07 WrapperNode [2022-12-06 16:35:07,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:35:07,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:35:07,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:35:07,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:35:07,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,271 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 16:35:07,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:35:07,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:35:07,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:35:07,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:35:07,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:35:07,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:35:07,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:35:07,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:35:07,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (1/1) ... [2022-12-06 16:35:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:35:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:35:07,365 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) [2022-12-06 16:35:07,368 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 [2022-12-06 16:35:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:35:07,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:35:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:35:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:35:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:35:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:35:07,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:35:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:35:07,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:35:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 16:35:07,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 16:35:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:35:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:35:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:35:07,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:35:07,405 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:35:07,581 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:35:07,583 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:35:07,947 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:35:08,065 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:35:08,066 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:35:08,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:08 BoogieIcfgContainer [2022-12-06 16:35:08,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:35:08,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:35:08,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:35:08,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:35:08,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:35:06" (1/3) ... [2022-12-06 16:35:08,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3d4bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:35:08, skipping insertion in model container [2022-12-06 16:35:08,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:07" (2/3) ... [2022-12-06 16:35:08,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3d4bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:35:08, skipping insertion in model container [2022-12-06 16:35:08,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:08" (3/3) ... [2022-12-06 16:35:08,075 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-12-06 16:35:08,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:35:08,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:35:08,093 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:35:08,143 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:35:08,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 16:35:08,265 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 16:35:08,266 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:35:08,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 16:35:08,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 16:35:08,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 16:35:08,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:35:08,303 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@da0fa32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:35:08,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 16:35:08,329 INFO L130 PetriNetUnfolder]: 0/56 cut-off events. [2022-12-06 16:35:08,330 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:35:08,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:08,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:08,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 318125694, now seen corresponding path program 1 times [2022-12-06 16:35:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332775012] [2022-12-06 16:35:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:08,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332775012] [2022-12-06 16:35:08,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332775012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:08,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:08,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:35:08,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488164811] [2022-12-06 16:35:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:35:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:08,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:35:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:35:08,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 107 [2022-12-06 16:35:08,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:08,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:08,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 107 [2022-12-06 16:35:08,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:09,093 INFO L130 PetriNetUnfolder]: 37/215 cut-off events. [2022-12-06 16:35:09,093 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 16:35:09,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 215 events. 37/215 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 711 event pairs, 7 based on Foata normal form. 13/213 useless extension candidates. Maximal degree in co-relation 259. Up to 51 conditions per place. [2022-12-06 16:35:09,099 INFO L137 encePairwiseOnDemand]: 102/107 looper letters, 11 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2022-12-06 16:35:09,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 246 flow [2022-12-06 16:35:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:35:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:35:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2022-12-06 16:35:09,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2022-12-06 16:35:09,121 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places. [2022-12-06 16:35:09,121 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 246 flow [2022-12-06 16:35:09,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:09,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:09,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:09,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:35:09,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash 316434338, now seen corresponding path program 1 times [2022-12-06 16:35:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683786093] [2022-12-06 16:35:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:09,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:09,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683786093] [2022-12-06 16:35:09,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683786093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:09,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:09,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:35:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969252225] [2022-12-06 16:35:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:09,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:35:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:09,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:35:09,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:35:09,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2022-12-06 16:35:09,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:09,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:09,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2022-12-06 16:35:09,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:10,035 INFO L130 PetriNetUnfolder]: 330/1054 cut-off events. [2022-12-06 16:35:10,035 INFO L131 PetriNetUnfolder]: For 307/383 co-relation queries the response was YES. [2022-12-06 16:35:10,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1054 events. 330/1054 cut-off events. For 307/383 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7033 event pairs, 43 based on Foata normal form. 0/1023 useless extension candidates. Maximal degree in co-relation 1908. Up to 273 conditions per place. [2022-12-06 16:35:10,047 INFO L137 encePairwiseOnDemand]: 101/107 looper letters, 24 selfloop transitions, 2 changer transitions 52/152 dead transitions. [2022-12-06 16:35:10,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 152 transitions, 552 flow [2022-12-06 16:35:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:35:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:35:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 830 transitions. [2022-12-06 16:35:10,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8618899273104881 [2022-12-06 16:35:10,053 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 8 predicate places. [2022-12-06 16:35:10,053 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 152 transitions, 552 flow [2022-12-06 16:35:10,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:10,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:10,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:10,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:35:10,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -200020657, now seen corresponding path program 1 times [2022-12-06 16:35:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:10,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398530388] [2022-12-06 16:35:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398530388] [2022-12-06 16:35:10,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398530388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:35:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399956542] [2022-12-06 16:35:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:35:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:35:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:35:10,368 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:35:10,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 152 transitions, 552 flow. Second operand has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:10,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:10,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:35:10,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:11,364 INFO L130 PetriNetUnfolder]: 1940/5035 cut-off events. [2022-12-06 16:35:11,365 INFO L131 PetriNetUnfolder]: For 1929/3931 co-relation queries the response was YES. [2022-12-06 16:35:11,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11791 conditions, 5035 events. 1940/5035 cut-off events. For 1929/3931 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 44861 event pairs, 85 based on Foata normal form. 4/4930 useless extension candidates. Maximal degree in co-relation 11731. Up to 1291 conditions per place. [2022-12-06 16:35:11,394 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 47 selfloop transitions, 12 changer transitions 214/341 dead transitions. [2022-12-06 16:35:11,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 341 transitions, 1984 flow [2022-12-06 16:35:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:35:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:35:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1161 transitions. [2022-12-06 16:35:11,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8346513299784328 [2022-12-06 16:35:11,399 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2022-12-06 16:35:11,399 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 341 transitions, 1984 flow [2022-12-06 16:35:11,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.14285714285714) internal successors, (575), 7 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:11,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:11,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:11,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:35:11,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1265697197, now seen corresponding path program 1 times [2022-12-06 16:35:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:11,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562741348] [2022-12-06 16:35:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:11,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562741348] [2022-12-06 16:35:11,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562741348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:11,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:11,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:35:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203695003] [2022-12-06 16:35:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:11,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:35:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:35:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:35:11,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:35:11,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 341 transitions, 1984 flow. Second operand has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:11,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:11,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:35:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:12,982 INFO L130 PetriNetUnfolder]: 2466/6640 cut-off events. [2022-12-06 16:35:12,985 INFO L131 PetriNetUnfolder]: For 2830/14114 co-relation queries the response was YES. [2022-12-06 16:35:13,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19137 conditions, 6640 events. 2466/6640 cut-off events. For 2830/14114 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 63979 event pairs, 61 based on Foata normal form. 44/6581 useless extension candidates. Maximal degree in co-relation 19070. Up to 1706 conditions per place. [2022-12-06 16:35:13,017 INFO L137 encePairwiseOnDemand]: 94/107 looper letters, 33 selfloop transitions, 10 changer transitions 349/460 dead transitions. [2022-12-06 16:35:13,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 460 transitions, 3524 flow [2022-12-06 16:35:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:35:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:35:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1491 transitions. [2022-12-06 16:35:13,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8196811434854315 [2022-12-06 16:35:13,023 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 36 predicate places. [2022-12-06 16:35:13,023 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 460 transitions, 3524 flow [2022-12-06 16:35:13,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.0) internal successors, (656), 8 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:13,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:13,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:13,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:35:13,024 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1917566230, now seen corresponding path program 1 times [2022-12-06 16:35:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:13,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340150501] [2022-12-06 16:35:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340150501] [2022-12-06 16:35:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340150501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:13,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:13,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:35:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692852851] [2022-12-06 16:35:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:13,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:35:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:35:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:35:13,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:35:13,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 460 transitions, 3524 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:13,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:13,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:35:13,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:14,780 INFO L130 PetriNetUnfolder]: 3554/9658 cut-off events. [2022-12-06 16:35:14,780 INFO L131 PetriNetUnfolder]: For 4724/25590 co-relation queries the response was YES. [2022-12-06 16:35:14,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33650 conditions, 9658 events. 3554/9658 cut-off events. For 4724/25590 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 101042 event pairs, 33 based on Foata normal form. 26/9597 useless extension candidates. Maximal degree in co-relation 33576. Up to 2479 conditions per place. [2022-12-06 16:35:14,832 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 50 selfloop transitions, 10 changer transitions 832/960 dead transitions. [2022-12-06 16:35:14,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 960 transitions, 9740 flow [2022-12-06 16:35:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:35:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:35:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1164 transitions. [2022-12-06 16:35:14,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8368080517613228 [2022-12-06 16:35:14,839 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 48 predicate places. [2022-12-06 16:35:14,840 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 960 transitions, 9740 flow [2022-12-06 16:35:14,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:14,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:14,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:14,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:35:14,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash -421471323, now seen corresponding path program 1 times [2022-12-06 16:35:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:14,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706051212] [2022-12-06 16:35:14,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:15,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:15,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706051212] [2022-12-06 16:35:15,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706051212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:15,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:15,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:35:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716364746] [2022-12-06 16:35:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:15,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:35:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:15,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:35:15,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:35:15,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:35:15,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 960 transitions, 9740 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:15,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:15,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:35:15,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:17,016 INFO L130 PetriNetUnfolder]: 3930/11131 cut-off events. [2022-12-06 16:35:17,017 INFO L131 PetriNetUnfolder]: For 6738/47973 co-relation queries the response was YES. [2022-12-06 16:35:17,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44654 conditions, 11131 events. 3930/11131 cut-off events. For 6738/47973 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 122957 event pairs, 38 based on Foata normal form. 105/11160 useless extension candidates. Maximal degree in co-relation 44573. Up to 3043 conditions per place. [2022-12-06 16:35:17,071 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 54 selfloop transitions, 9 changer transitions 993/1124 dead transitions. [2022-12-06 16:35:17,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1124 transitions, 13674 flow [2022-12-06 16:35:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:35:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:35:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1164 transitions. [2022-12-06 16:35:17,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8368080517613228 [2022-12-06 16:35:17,078 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 60 predicate places. [2022-12-06 16:35:17,078 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 1124 transitions, 13674 flow [2022-12-06 16:35:17,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:17,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:17,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:17,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:35:17,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1712528993, now seen corresponding path program 1 times [2022-12-06 16:35:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:17,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896831346] [2022-12-06 16:35:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:17,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896831346] [2022-12-06 16:35:17,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896831346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:17,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:17,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:35:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589964492] [2022-12-06 16:35:17,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:17,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:35:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:35:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:35:17,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:35:17,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1124 transitions, 13674 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:17,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:17,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:35:17,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:19,849 INFO L130 PetriNetUnfolder]: 5062/14855 cut-off events. [2022-12-06 16:35:19,850 INFO L131 PetriNetUnfolder]: For 10409/85072 co-relation queries the response was YES. [2022-12-06 16:35:19,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67483 conditions, 14855 events. 5062/14855 cut-off events. For 10409/85072 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 174387 event pairs, 45 based on Foata normal form. 118/14842 useless extension candidates. Maximal degree in co-relation 67395. Up to 4255 conditions per place. [2022-12-06 16:35:19,908 INFO L137 encePairwiseOnDemand]: 96/107 looper letters, 39 selfloop transitions, 9 changer transitions 1353/1469 dead transitions. [2022-12-06 16:35:19,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1469 transitions, 20959 flow [2022-12-06 16:35:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:35:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:35:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1504 transitions. [2022-12-06 16:35:19,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8268279274326553 [2022-12-06 16:35:19,918 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 76 predicate places. [2022-12-06 16:35:19,918 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 1469 transitions, 20959 flow [2022-12-06 16:35:19,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:19,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:19,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:19,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:35:19,922 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1474414355, now seen corresponding path program 2 times [2022-12-06 16:35:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:19,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869438443] [2022-12-06 16:35:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:19,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:20,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869438443] [2022-12-06 16:35:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869438443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:20,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:20,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:35:20,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559511568] [2022-12-06 16:35:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:35:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:35:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:35:20,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2022-12-06 16:35:20,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1469 transitions, 20959 flow. Second operand has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:20,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:20,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2022-12-06 16:35:20,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:23,237 INFO L130 PetriNetUnfolder]: 5494/16525 cut-off events. [2022-12-06 16:35:23,237 INFO L131 PetriNetUnfolder]: For 13050/47595 co-relation queries the response was YES. [2022-12-06 16:35:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83516 conditions, 16525 events. 5494/16525 cut-off events. For 13050/47595 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 199657 event pairs, 51 based on Foata normal form. 254/16660 useless extension candidates. Maximal degree in co-relation 83421. Up to 4827 conditions per place. [2022-12-06 16:35:23,306 INFO L137 encePairwiseOnDemand]: 95/107 looper letters, 28 selfloop transitions, 5 changer transitions 1500/1601 dead transitions. [2022-12-06 16:35:23,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1601 transitions, 26033 flow [2022-12-06 16:35:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 16:35:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 16:35:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1852 transitions. [2022-12-06 16:35:23,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8242100578549176 [2022-12-06 16:35:23,311 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 96 predicate places. [2022-12-06 16:35:23,312 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 1601 transitions, 26033 flow [2022-12-06 16:35:23,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 82.375) internal successors, (659), 8 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:23,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:23,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:23,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:35:23,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:23,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 550639017, now seen corresponding path program 3 times [2022-12-06 16:35:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:23,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142075608] [2022-12-06 16:35:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:23,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:23,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142075608] [2022-12-06 16:35:23,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142075608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:23,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:23,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:35:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855862717] [2022-12-06 16:35:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:23,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:35:23,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:35:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:35:23,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:35:23,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 1601 transitions, 26033 flow. Second operand has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 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) [2022-12-06 16:35:23,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:23,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:35:23,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:24,718 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][359], [99#L805true, 137#true, 192#true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,718 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,718 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,718 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,718 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,718 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][333], [80#L812true, 137#true, 192#true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, 87#L745true, P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,719 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,719 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,719 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,719 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,811 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][357], [99#L805true, 137#true, 243#true, 192#true, 118#true, 215#true, 275#true, 65#L4true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,812 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][335], [80#L812true, 137#true, 243#true, 192#true, 118#true, 215#true, 275#true, 87#L745true, 65#L4true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,812 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,812 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:24,938 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][359], [72#L4-1true, 99#L805true, 137#true, 192#true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,938 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,938 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,938 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,938 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,939 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][333], [72#L4-1true, 80#L812true, 137#true, 192#true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, 87#L745true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,939 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,939 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,939 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,939 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,939 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][320], [99#L805true, 43#L792true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,939 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][342], [16#L785true, 80#L812true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,940 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,940 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][350], [99#L805true, 16#L785true, 137#true, 192#true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:24,940 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,941 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,941 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:24,941 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,072 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][357], [72#L4-1true, 99#L805true, 137#true, 243#true, 192#true, 118#true, 215#true, 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,072 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,072 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,073 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,073 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,073 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][335], [72#L4-1true, 80#L812true, 137#true, 243#true, 192#true, 118#true, 215#true, 275#true, 87#L745true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,073 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,073 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,073 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,073 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,074 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][349], [247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 16#L785true, 80#L812true, 118#true, 87#L745true, 217#(= ~y~0 1), 65#L4true, P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,074 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,074 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,074 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,074 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,075 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][331], [99#L805true, 16#L785true, 137#true, 243#true, 192#true, 118#true, 217#(= ~y~0 1), 65#L4true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,075 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,075 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,075 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,075 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,075 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][356], [247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 99#L805true, 43#L792true, 118#true, 87#L745true, 217#(= ~y~0 1), 65#L4true, P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,076 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:25,244 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][320], [72#L4-1true, 99#L805true, 43#L792true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,244 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][342], [72#L4-1true, 16#L785true, 80#L812true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,245 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,245 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,246 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][350], [72#L4-1true, 99#L805true, 16#L785true, 137#true, 192#true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,246 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,246 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,246 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,246 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,492 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][349], [72#L4-1true, 247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 16#L785true, 80#L812true, 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,492 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,492 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,492 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,492 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,492 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][331], [72#L4-1true, 99#L805true, 16#L785true, 137#true, 243#true, 192#true, 118#true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:25,492 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][356], [72#L4-1true, 247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 99#L805true, 43#L792true, 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 163#(= ~__unbuffered_p2_EAX~0 0), 121#true]) [2022-12-06 16:35:25,493 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:25,493 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:28,786 INFO L130 PetriNetUnfolder]: 11401/27042 cut-off events. [2022-12-06 16:35:28,786 INFO L131 PetriNetUnfolder]: For 199806/265682 co-relation queries the response was YES. [2022-12-06 16:35:28,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132216 conditions, 27042 events. 11401/27042 cut-off events. For 199806/265682 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 299669 event pairs, 324 based on Foata normal form. 1809/28105 useless extension candidates. Maximal degree in co-relation 132117. Up to 9593 conditions per place. [2022-12-06 16:35:28,906 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 50 selfloop transitions, 6 changer transitions 1476/1625 dead transitions. [2022-12-06 16:35:28,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1625 transitions, 28422 flow [2022-12-06 16:35:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:35:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:35:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 921 transitions. [2022-12-06 16:35:28,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8607476635514019 [2022-12-06 16:35:28,908 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 105 predicate places. [2022-12-06 16:35:28,908 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 1625 transitions, 28422 flow [2022-12-06 16:35:28,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.0) internal successors, (516), 6 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) [2022-12-06 16:35:28,909 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:28,909 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:28,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:35:28,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1616792868, now seen corresponding path program 1 times [2022-12-06 16:35:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:28,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791588399] [2022-12-06 16:35:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:29,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791588399] [2022-12-06 16:35:29,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791588399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:29,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:29,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:35:29,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992889934] [2022-12-06 16:35:29,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:29,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:35:29,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:29,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:35:29,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:35:29,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:35:29,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1625 transitions, 28422 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:29,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:29,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:35:29,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:30,025 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][226], [99#L805true, 137#true, 192#true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 21#L782true, 48#L3true, 82#L761true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,025 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,025 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,025 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,025 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,132 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][248], [99#L805true, 137#true, 243#true, 192#true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, 21#L782true, 48#L3true, 82#L761true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,133 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,133 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,133 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,133 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-12-06 16:35:30,263 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][224], [80#L812true, 137#true, 192#true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, 87#L745true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 21#L782true, 48#L3true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,263 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,263 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,263 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,263 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,272 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][326], [80#L812true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, 87#L745true, P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,272 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,272 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,272 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,272 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,272 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][362], [99#L805true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,272 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,272 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,272 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,273 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,274 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][213], [99#L805true, 16#L785true, 137#true, 192#true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 246#(= ~__unbuffered_p0_EAX~0 0), 118#true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork0InUse, 48#L3true, 82#L761true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,274 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,274 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,274 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][214], [99#L805true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 48#L3true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,275 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][279], [16#L785true, 80#L812true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 48#L3true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,275 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,275 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,365 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][247], [80#L812true, 137#true, 243#true, 192#true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 275#true, 87#L745true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 21#L782true, 48#L3true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,365 INFO L382 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,366 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,366 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,366 INFO L385 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-12-06 16:35:30,376 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][329], [99#L805true, 137#true, 243#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 275#true, 65#L4true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,376 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,376 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,376 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,376 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,377 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][332], [80#L812true, 137#true, 243#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 275#true, 87#L745true, 65#L4true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,377 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,377 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,377 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,377 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][308], [99#L805true, 16#L785true, 137#true, 243#true, 192#true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 48#L3true, 82#L761true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,378 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][310], [247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 16#L785true, 80#L812true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 48#L3true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,378 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,378 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,379 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][312], [247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 99#L805true, 328#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 347#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 48#L3true, 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,379 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,379 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,379 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,379 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 16:35:30,543 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][339], [99#L805true, 16#L785true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,543 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,543 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,543 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,543 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,544 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][367], [99#L805true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,544 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,544 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,544 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,544 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,554 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][326], [72#L4-1true, 80#L812true, 137#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 192#true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, 87#L745true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,554 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,554 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,554 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,554 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,555 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][362], [72#L4-1true, 99#L805true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,555 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,555 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,555 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,555 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,697 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][353], [99#L805true, 16#L785true, 137#true, 243#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,697 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,697 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,697 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,697 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,698 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][338], [247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 99#L805true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,698 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,698 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,698 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,698 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,711 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][329], [72#L4-1true, 99#L805true, 137#true, 243#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,711 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,711 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,711 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,711 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,712 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][332], [72#L4-1true, 80#L812true, 137#true, 243#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 275#true, 87#L745true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 21#L782true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,712 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,712 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,712 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,712 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-12-06 16:35:30,868 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][326], [16#L785true, 80#L812true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,868 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,868 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,868 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,868 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,869 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][358], [99#L805true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,869 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,869 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,869 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,869 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,888 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][339], [72#L4-1true, 99#L805true, 16#L785true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,888 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,888 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,888 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,888 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,889 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][367], [72#L4-1true, 99#L805true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,889 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,889 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,889 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,889 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:30,891 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][322], [16#L785true, 80#L812true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:30,891 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-06 16:35:30,891 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:35:30,891 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:35:30,891 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:35:31,219 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([314] L745-->L761: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_50 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd1~0_50 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and (= (mod v_~x$w_buff1_used~0_113 256) 0) .cse10)) (.cse12 (= (mod v_~x$w_buff0_used~0_128 256) 0)) (.cse6 (and .cse10 .cse8))) (let ((.cse2 (or .cse4 .cse12 .cse6)) (.cse3 (and .cse11 (not .cse12)))) (let ((.cse0 (ite .cse2 v_~x~0_69 (ite .cse3 v_~x$w_buff0~0_51 v_~x$w_buff1~0_50))) (.cse1 (not (= (mod v_~weak$$choice2~0_38 256) 0))) (.cse9 (= 0 (mod v_~x$w_buff1_used~0_112 256))) (.cse5 (= (mod v_~x$w_buff0_used~0_127 256) 0))) (and (= v_~__unbuffered_p0_EBX~0_14 .cse0) (= v_~x$flush_delayed~0_19 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_38) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_9) (= (ite .cse1 v_~x$w_buff0_used~0_128 (ite .cse2 v_~x$w_buff0_used~0_128 (ite .cse3 0 v_~x$w_buff0_used~0_128))) v_~x$w_buff0_used~0_127) (= v_~x$w_buff1_used~0_112 (ite .cse1 v_~x$w_buff1_used~0_113 (ite (or .cse4 .cse5 .cse6) v_~x$w_buff1_used~0_113 0))) (= v_~x$w_buff0~0_51 v_~x$w_buff0~0_50) (= v_~x~0_68 (ite .cse1 v_~x$mem_tmp~0_18 .cse0)) (= v_~x$w_buff1~0_49 v_~x$w_buff1~0_50) (= v_~x~0_69 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd1~0_49 (ite .cse1 v_~x$r_buff1_thd1~0_50 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_49 256) 0))) (or (and .cse7 .cse8) (and .cse7 .cse9) .cse5)) v_~x$r_buff1_thd1~0_50 0))) (= v_~x$r_buff0_thd1~0_49 (ite .cse1 v_~x$r_buff0_thd1~0_50 (ite (or (and .cse9 .cse10) .cse5 .cse6) v_~x$r_buff0_thd1~0_50 (ite (and .cse11 (not .cse5)) 0 v_~x$r_buff0_thd1~0_50))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_51, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_50, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_50, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_69, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_49, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_38, ~x~0=v_~x~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3][353], [72#L4-1true, 99#L805true, 16#L785true, 137#true, 243#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,219 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,219 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,219 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,219 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,220 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][338], [72#L4-1true, 247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 99#L805true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 43#L792true, 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 277#(= ~y~0 1), P0Thread1of1ForFork2InUse, 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,220 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,220 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,220 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,220 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-12-06 16:35:31,221 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][334], [247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 16#L785true, 80#L812true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, 65#L4true, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,221 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-12-06 16:35:31,221 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:35:31,221 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:35:31,221 INFO L385 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-12-06 16:35:31,368 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][326], [72#L4-1true, 16#L785true, 80#L812true, 137#true, 192#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,368 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L785-->L792: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_22 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0)))) (let ((.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_112 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_99 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x$w_buff1_used~0_98 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_99)) (= v_~x$r_buff0_thd2~0_24 (ite .cse2 0 v_~x$r_buff0_thd2~0_25)) (= v_~x$r_buff1_thd2~0_21 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_98 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)))) 0 v_~x$r_buff1_thd2~0_22)) (= (ite .cse0 v_~x$w_buff0~0_36 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_55)) v_~x~0_54)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_99, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_98, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][358], [72#L4-1true, 99#L805true, 137#true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 192#true, 43#L792true, 118#true, 215#true, 246#(= ~__unbuffered_p0_EAX~0 0), 275#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 82#L761true, 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,368 INFO L382 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,368 INFO L385 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-12-06 16:35:31,388 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][322], [72#L4-1true, 16#L785true, 80#L812true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 246#(= ~__unbuffered_p0_EAX~0 0), 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,388 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,388 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,388 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,388 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,663 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([329] L805-->L812: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_103 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_91 256) 0))))) (and (= v_~x$r_buff0_thd3~0_25 (ite .cse0 0 v_~x$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_91) v_~x$w_buff1_used~0_90) (= (ite .cse2 0 v_~x$w_buff0_used~0_104) v_~x$w_buff0_used~0_103) (= v_~x~0_48 (ite .cse2 v_~x$w_buff0~0_30 (ite .cse1 v_~x$w_buff1~0_31 v_~x~0_49))) (= v_~x$r_buff1_thd3~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_25 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_90 256) 0)))) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_26, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$w_buff1~0=v_~x$w_buff1~0_31, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_25, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_103} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][334], [72#L4-1true, 247#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 16#L785true, 80#L812true, 349#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 118#true, 87#L745true, 217#(= ~y~0 1), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 277#(= ~y~0 1), 140#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P1Thread1of1ForFork0InUse, 195#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 330#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 121#true, 163#(= ~__unbuffered_p2_EAX~0 0)]) [2022-12-06 16:35:31,663 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,663 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,663 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:35:31,663 INFO L385 tUnfolder$Statistics]: existing Event has 70 ancestors and is not cut-off event [2022-12-06 16:35:33,177 INFO L130 PetriNetUnfolder]: 8110/17480 cut-off events. [2022-12-06 16:35:33,177 INFO L131 PetriNetUnfolder]: For 179445/247059 co-relation queries the response was YES. [2022-12-06 16:35:33,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92423 conditions, 17480 events. 8110/17480 cut-off events. For 179445/247059 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 175048 event pairs, 158 based on Foata normal form. 2729/19813 useless extension candidates. Maximal degree in co-relation 92320. Up to 5799 conditions per place. [2022-12-06 16:35:33,255 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 37 selfloop transitions, 9 changer transitions 1396/1523 dead transitions. [2022-12-06 16:35:33,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1523 transitions, 29097 flow [2022-12-06 16:35:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:35:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:35:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1200 transitions. [2022-12-06 16:35:33,258 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8626887131560029 [2022-12-06 16:35:33,258 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 102 predicate places. [2022-12-06 16:35:33,258 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 1523 transitions, 29097 flow [2022-12-06 16:35:33,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:33,259 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:33,259 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:33,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:35:33,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:33,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1314949545, now seen corresponding path program 1 times [2022-12-06 16:35:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:33,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089479487] [2022-12-06 16:35:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:33,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:34,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089479487] [2022-12-06 16:35:34,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089479487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:34,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:34,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-06 16:35:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047061258] [2022-12-06 16:35:34,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:34,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 16:35:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:34,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 16:35:34,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 16:35:34,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 107 [2022-12-06 16:35:34,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1523 transitions, 29097 flow. Second operand has 12 states, 12 states have (on average 75.33333333333333) internal successors, (904), 12 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:34,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:34,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 107 [2022-12-06 16:35:34,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:37,701 INFO L130 PetriNetUnfolder]: 9434/22665 cut-off events. [2022-12-06 16:35:37,702 INFO L131 PetriNetUnfolder]: For 206441/233592 co-relation queries the response was YES. [2022-12-06 16:35:37,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111356 conditions, 22665 events. 9434/22665 cut-off events. For 206441/233592 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 252448 event pairs, 160 based on Foata normal form. 3248/25574 useless extension candidates. Maximal degree in co-relation 111239. Up to 5886 conditions per place. [2022-12-06 16:35:37,800 INFO L137 encePairwiseOnDemand]: 87/107 looper letters, 42 selfloop transitions, 29 changer transitions 2209/2377 dead transitions. [2022-12-06 16:35:37,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 2377 transitions, 51234 flow [2022-12-06 16:35:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 16:35:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 16:35:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1432 transitions. [2022-12-06 16:35:37,802 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7435098650051921 [2022-12-06 16:35:37,803 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 119 predicate places. [2022-12-06 16:35:37,803 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 2377 transitions, 51234 flow [2022-12-06 16:35:37,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 75.33333333333333) internal successors, (904), 12 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:37,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:37,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:37,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:35:37,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1661356151, now seen corresponding path program 2 times [2022-12-06 16:35:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:37,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611366647] [2022-12-06 16:35:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:38,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611366647] [2022-12-06 16:35:38,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611366647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:38,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:38,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:35:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993794527] [2022-12-06 16:35:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:35:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:35:38,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:35:38,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2022-12-06 16:35:38,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 2377 transitions, 51234 flow. Second operand has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 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) [2022-12-06 16:35:38,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:38,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2022-12-06 16:35:38,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:44,598 INFO L130 PetriNetUnfolder]: 8720/19620 cut-off events. [2022-12-06 16:35:44,598 INFO L131 PetriNetUnfolder]: For 190815/218344 co-relation queries the response was YES. [2022-12-06 16:35:44,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108234 conditions, 19620 events. 8720/19620 cut-off events. For 190815/218344 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 216572 event pairs, 167 based on Foata normal form. 2348/21761 useless extension candidates. Maximal degree in co-relation 108113. Up to 4630 conditions per place. [2022-12-06 16:35:44,684 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 69 selfloop transitions, 32 changer transitions 1778/1975 dead transitions. [2022-12-06 16:35:44,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 1975 transitions, 46428 flow [2022-12-06 16:35:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:35:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:35:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1443 transitions. [2022-12-06 16:35:44,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.842873831775701 [2022-12-06 16:35:44,688 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 101 predicate places. [2022-12-06 16:35:44,688 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 1975 transitions, 46428 flow [2022-12-06 16:35:44,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.0) internal successors, (688), 8 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) [2022-12-06 16:35:44,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:44,688 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:44,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:35:44,689 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash -351342984, now seen corresponding path program 1 times [2022-12-06 16:35:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:44,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951004695] [2022-12-06 16:35:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:35:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:35:45,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:35:45,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951004695] [2022-12-06 16:35:45,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951004695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:35:45,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:35:45,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-06 16:35:45,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282261939] [2022-12-06 16:35:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:35:45,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 16:35:45,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:35:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 16:35:45,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-06 16:35:45,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 107 [2022-12-06 16:35:45,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 1975 transitions, 46428 flow. Second operand has 11 states, 11 states have (on average 81.0909090909091) internal successors, (892), 11 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:45,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:35:45,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 107 [2022-12-06 16:35:45,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:35:48,441 INFO L130 PetriNetUnfolder]: 9976/22957 cut-off events. [2022-12-06 16:35:48,441 INFO L131 PetriNetUnfolder]: For 298667/329487 co-relation queries the response was YES. [2022-12-06 16:35:48,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126024 conditions, 22957 events. 9976/22957 cut-off events. For 298667/329487 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 263291 event pairs, 183 based on Foata normal form. 2295/25030 useless extension candidates. Maximal degree in co-relation 125891. Up to 5507 conditions per place. [2022-12-06 16:35:48,549 INFO L137 encePairwiseOnDemand]: 97/107 looper letters, 29 selfloop transitions, 11 changer transitions 2074/2203 dead transitions. [2022-12-06 16:35:48,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 2203 transitions, 55930 flow [2022-12-06 16:35:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 16:35:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 16:35:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 908 transitions. [2022-12-06 16:35:48,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7714528462192014 [2022-12-06 16:35:48,551 INFO L294 CegarLoopForPetriNet]: 112 programPoint places, 111 predicate places. [2022-12-06 16:35:48,551 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 2203 transitions, 55930 flow [2022-12-06 16:35:48,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.0909090909091) internal successors, (892), 11 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:35:48,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:35:48,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:48,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 16:35:48,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 16:35:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:35:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 85713834, now seen corresponding path program 2 times [2022-12-06 16:35:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:35:48,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852451488] [2022-12-06 16:35:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:35:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:35:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:35:48,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:35:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:35:48,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:35:48,914 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:35:48,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 16:35:48,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 16:35:48,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 16:35:48,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 16:35:48,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 16:35:48,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 16:35:48,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 16:35:48,922 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:35:48,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:35:48,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:35:49,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:35:49 BasicIcfg [2022-12-06 16:35:49,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:35:49,043 INFO L158 Benchmark]: Toolchain (without parser) took 42454.81ms. Allocated memory was 198.2MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 173.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 16:35:49,043 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 175.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:35:49,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.77ms. Allocated memory is still 198.2MB. Free memory was 173.5MB in the beginning and 147.8MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 16:35:49,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.56ms. Allocated memory is still 198.2MB. Free memory was 147.8MB in the beginning and 145.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:35:49,044 INFO L158 Benchmark]: Boogie Preprocessor took 43.55ms. Allocated memory is still 198.2MB. Free memory was 145.2MB in the beginning and 143.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:35:49,044 INFO L158 Benchmark]: RCFGBuilder took 751.21ms. Allocated memory is still 198.2MB. Free memory was 143.1MB in the beginning and 111.1MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 16:35:49,044 INFO L158 Benchmark]: TraceAbstraction took 40972.27ms. Allocated memory was 198.2MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 110.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 16:35:49,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 175.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 609.77ms. Allocated memory is still 198.2MB. Free memory was 173.5MB in the beginning and 147.8MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.56ms. Allocated memory is still 198.2MB. Free memory was 147.8MB in the beginning and 145.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.55ms. Allocated memory is still 198.2MB. Free memory was 145.2MB in the beginning and 143.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 751.21ms. Allocated memory is still 198.2MB. Free memory was 143.1MB in the beginning and 111.1MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 40972.27ms. Allocated memory was 198.2MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 110.1MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L829] 0 pthread_t t1828; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-2, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L831] 0 pthread_t t1829; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [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)) [L19] 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_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] 0 pthread_t t1830; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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 [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 834]: 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: 830]: 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: 832]: 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 7 procedures, 133 locations, 6 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: 40.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1266 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1266 mSDsluCounter, 848 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2317 IncrementalHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 173 mSDtfsCounter, 2317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55930occurred in iteration=13, InterpolantAutomatonStates: 174, 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.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 3773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [2022-12-06 16:35:49,066 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...